{"_id":"@bobzi/my-lib-leetcode","name":"@bobzi/my-lib-leetcode","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"@bobzi/my-lib-leetcode","version":"1.0.0","description":"leetcode-脚手架","main":"index.js","bin":{"leetcli":"bin/leetcli.js"},"scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"author":{"name":"Bob Zi"},"license":"MIT","dependencies":{"commander":"^14.0.3"},"devDependencies":{"vite":"^7.3.1"},"_id":"@bobzi/my-lib-leetcode@1.0.0","gitHead":"0e45b47694bd6a9ef8de233837b73ea8e5b51e57","_nodeVersion":"23.11.0","_npmVersion":"10.9.2","dist":{"integrity":"sha512-28XBYc8BR6AStVGqvcYKArhhwQiIrruacUmOnEFNwmYqHdvAbUG9PEfLso0RZN0/F0bNFzbP9BvZIk67zKsYRA==","shasum":"54e6faaabe3cf48ef11fa96b2ce519bcd2603d3e","tarball":"https://registry.npmjs.org/@bobzi/my-lib-leetcode/-/my-lib-leetcode-1.0.0.tgz","fileCount":57,"unpackedSize":53180,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEQCID2G+gMbK/uBknvnuOjAaSMGFnV5Ama+qbYqTjrUA+k9AiABRH1MdC/dl/R+FMet6tTxLVMcrw+jpuQx5203YdyTSA=="}]},"_npmUser":{"name":"bobzi","email":"583139315@qq.com"},"directories":{},"maintainers":[{"name":"bobzi","email":"583139315@qq.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/my-lib-leetcode_1.0.0_1773121575760_0.7862296557521304"},"_hasShrinkwrap":false}},"time":{"created":"2026-03-10T05:46:15.638Z","1.0.0":"2026-03-10T05:46:15.915Z","modified":"2026-03-10T05:46:16.200Z"},"maintainers":[{"name":"bobzi","email":"583139315@qq.com"}],"description":"leetcode-脚手架","author":{"name":"Bob Zi"},"license":"MIT","readme":"# 算法\n\n4. 并发请求数量控制\n5. 岛屿数量\n6. 无重复字符的最长子串\n7. 组合总和 II\n8. 实现 Trie (前缀树)\n9. 反转链表 II\n10. 被围绕的区域\n11. 求根节点到叶节点数字之和\n12. 颜色分类\n13. 恢复二叉搜索树\n14. 旋转图像\n15. 螺旋矩阵\n16. 最长回文子串\n17. 平衡二叉树\n18. 最小栈\n\n# 项目难点\n\n1、大文件上传、断点续传\n2、图片裁剪、加滤镜\n3、组件封装（树的弹框）\n4、打包优化（webpack 改为 vite --为什么改？如何改？首屏优化-）\n5、echarts 优化（大数量的渲染）\n6、写一个插件，发布\n","readmeFilename":"Readme.md","_rev":"1-ab14a702af8a2126049853d3550f158b"}