{"id":18309426,"url":"https://github.com/masterjoyhunan/2048-mp","last_synced_at":"2026-01-20T08:03:19.966Z","repository":{"id":81016612,"uuid":"145781913","full_name":"MasterJoyHunan/2048-mp","owner":"MasterJoyHunan","description":"小程序2048游戏源码","archived":false,"fork":false,"pushed_at":"2018-08-23T02:42:23.000Z","size":72,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-09T11:50:10.647Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Vue","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MasterJoyHunan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-08-23T01:15:06.000Z","updated_at":"2020-04-23T02:55:08.000Z","dependencies_parsed_at":"2023-05-13T03:00:38.194Z","dependency_job_id":null,"html_url":"https://github.com/MasterJoyHunan/2048-mp","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MasterJoyHunan/2048-mp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterJoyHunan%2F2048-mp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterJoyHunan%2F2048-mp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterJoyHunan%2F2048-mp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterJoyHunan%2F2048-mp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MasterJoyHunan","download_url":"https://codeload.github.com/MasterJoyHunan/2048-mp/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterJoyHunan%2F2048-mp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28598875,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-20T02:08:49.799Z","status":"ssl_error","status_checked_at":"2026-01-20T02:08:44.148Z","response_time":117,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-05T16:11:23.658Z","updated_at":"2026-01-20T08:03:19.951Z","avatar_url":"https://github.com/MasterJoyHunan.png","language":"Vue","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 2048 小程序移植版\n\n\u003e 使用mpvue编写的2048小程序, 仅供交流学习.\n\n## 图片展示\n\n![2048](http://olj.masterjoy.top/joy/2048.png)\n\n## 核心代码\n\n初始化\n```\n[00][01][02][03]\n[10][11][12][13]\n[20][21][22][23]\n[30][31][32][33]\n```\n(例)左移\n```\n假设\n索引为 =\u003e [00][01][02][03]\n对应值 =\u003e  2   2   0   4\n\n1.建立一个栈\n2.从左入栈,如果入栈元素为0, 不做任何处理\n    否则每入一个栈之前和栈顶元素做对比\n        如果和栈顶元素不同,入栈 {number: x, flag: false}\n        如果和栈顶元素相同,并且flag==false把当前需要入栈的元素抛弃,把栈顶的元素抛出来,并乘以2,加上flag = true,防止多次累加\n3.循环完成一轮之后进行解构赋值\n    栈底第一个的值赋值给[00]\n    栈底第二个的值赋值给[01]\n    栈底第三个的值赋值给[02]\n    栈底第四个的值赋值给[03]    \n```\n```\n步骤展示\n1. [00] =\u003e 2 需要入栈 {number:2, falg: false}\n \n|{number:2, falg: false}|\n|_______________________|\n \n2. [01] =\u003e 2  需要入栈 {number:2, falg: false} , 和栈顶对比, 可以合并\n \n|{number:2, falg: false}|   \n|_______________________|\n            ∨\n|{number:4, falg: true }|\n|_______________________|\n \n4. [02] =\u003e 0 直接抛弃\n \n|{number:4, falg: true }|\n|_______________________|\n \n5. [03] =\u003e 4 需要入栈 {number:2, falg: false}, 和栈顶对比, 虽然数值一样,但是flag=true, 无法合并, 入栈\n \n|{number:4, falg: flase}|\n|{number:4, falg: true }|\n|_______________________|\n \n--完成入栈, 进行赋值解构--\n[0][0] = 4\n[0][1] = 4\n[0][2] = 0\n[0][3] = 0\n```\n## 代码实现\n```javascript\nfor (let i = 0; i \u003c 4; i++) {\n    var stack = new Stack()  // 利用数组实现的栈结构\n    for (let j = 0; j \u003c 4; j++) {\n        if (this.pie[i][j].number != 0) {\n            const top = stack.getTop()\n            if (!top.lock \u0026\u0026 top.number == this.pie[i][j].number) {\n                const current = stack.pop()\n                current.number *= 2\n                current.lock = true\n                stack.push(current)\n            } else {\n                stack.push({ number: this.pie[i][j].number, lock: false })\n            }\n        }\n    }\n    for (let j = 0; j \u003c 4; j++) {\n        this.pie[i][j].number = stack.data[j] ? stack.data[j].number : 0\n    }\n}\n```\n\n## Build Setup\n\n``` bash\n# install dependencies\nnpm install\n\n# serve with hot reload at localhost:8080\nnpm run dev\n\n# build for production with minification\nnpm run build\n\n# build for production and view the bundle analyzer report\nnpm run build --report\n```\n\nFor detailed explanation on how things work, checkout the [guide](http://vuejs-templates.github.io/webpack/) and [docs for vue-loader](http://vuejs.github.io/vue-loader).\n\n# 协议\n\u003e license MIT\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmasterjoyhunan%2F2048-mp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmasterjoyhunan%2F2048-mp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmasterjoyhunan%2F2048-mp/lists"}