[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-407":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":10,"totalLinesOfCode":10,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":16,"subscribersCount":16,"size":16,"stars1d":16,"stars7d":17,"stars30d":18,"stars90d":16,"forks30d":16,"starsTrendScore":19,"compositeScore":20,"rankGlobal":10,"rankLanguage":10,"license":10,"archived":21,"fork":21,"defaultBranch":22,"hasWiki":23,"hasPages":21,"topics":24,"createdAt":10,"pushedAt":10,"updatedAt":30,"readmeContent":31,"aiSummary":32,"trendingCount":16,"starSnapshotCount":16,"syncStatus":33,"lastSyncTime":34,"discoverSource":35},407,"LeetCodeAnimation","MisterBooo\u002FLeetCodeAnimation","MisterBooo","Demonstrate all the questions on LeetCode in the form of animation.（用动画的形式呈现解LeetCode题目的思路）","",null,"Java",76592,13902,2509,18,0,11,23,4,74.8,false,"master",true,[25,26,27,28,29],"animation","leetcode","leetcode-c","leetcode-java","leetcode-solutions","2026-06-17 04:00:03","![LeetCode Animation All in One](https:\u002F\u002Fupload-images.jianshu.io\u002Fupload_images\u002F1940317-e837182a805cecce.png?imageMogr2\u002Fauto-orient\u002Fstrip%7CimageView2\u002F2\u002Fw\u002F1240)\n\n[![Travis](https:\u002F\u002Fimg.shields.io\u002Fbadge\u002Flanguage-C++-red.svg)](https:\u002F\u002Fdeveloper.apple.com\u002F.md)\n[![Travis](https:\u002F\u002Fimg.shields.io\u002Fbadge\u002Flanguage-Java-yellow.svg)](https:\u002F\u002Fdeveloper.apple.com\u002F.md)\n\n\n[There is an English version of README here. just click it！](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Fblob\u002Fmaster\u002FREADME-En.md)\n\n我会尽力将 LeetCode 上所有的题目都用动画的形式演示出来，计划用 3 到 4 年时间去完成它，期待与你见证这一天！\n\n文章最新首发于微信公众号 **吴师兄学算法**，您可以关注获取最新的文章。\n\n为了帮助大家更好的入门学习算法，经过半年的积累，我给大家整理了《剑指 Offer》系列的四十道题目，都是算法面试的高频题目，每一道题目我都提供详细的分析、精美的配图、易于理解的动画视频，适合那些第一次刷题的同学，当然，也适合重复刷题的老手再次学习巩固基础。\n\n![](https:\u002F\u002Fweixin-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fqebp5.png)\n\n\n文章同步博客地址：https:\u002F\u002Fblog.algomooc.com\u002F\n\n## 汇总\n\n| 序号 | 题目&题解                                                    | 动画                                                         |\n| ---- | ------------------------------------------------------------ | ------------------------------------------------------------ |\n| 0    | [十大经典排序算法动画与解析，看我就够了！（配代码完全版）](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002Fvn3KiV-ez79FmbZ36SX9lg) |                                                              |\n| 1    | [两数之和](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第1号问题：两数之和.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fav47v.gif) |\n| 2    | [两数相加](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第2号问题：两数相加.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Ffz933.gif) |\n| 3    | [无重复字符的最长子串](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第3号问题：无重复字符的最长子串.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fvxa7f.gif) |\n| 4    | [寻找两个有序数组的中位数](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FFBlH7o-ssj_iMEPLcvsY2w) |                                                              |\n| 9    | [回文数](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第9号问题：回文数.md) |                                                              |\n| 10   | [正则表达式匹配](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FZoytuPt5dfP5pMODbuKnCQ) |                                                              |\n| 11   | [盛最多水的容器](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002F0PCW-7JzU8rfrLA5GQmFiQ) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fen8u4.gif) |\n| 15   | [三数之和](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第15号问题：三数之和.md) |                                                              |\n| 19   | [删除链表的倒数第 N 个节点](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第19号问题：删除链表的倒数第N个节点.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fmetqn.gif) |\n| 20   | [有效的括号](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第20号问题：有效的括号.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fey3lr.gif) |\n| 21   | [合并两个有序链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第21号问题：合并两个有序链表.md) |                                                              |\n| 23   | [合并 K 个排序链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第23号问题：合并K个排序链表.md) |                                                              |\n| 24   | [两两交换链表中的节点](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第24号问题：两两交换链表中的节点.md) |                                                              |\n| 25   | [K 个一组翻转链表](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FYOz66mJchVIEQjA7TBV2cg) |                                                              |\n| 26   | [删除排序数组中的重复项](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第26号问题：删除排序数组中的重复项.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002F4tk72.gif) |\n| 32   | [最长有效括号](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FCPIDKHsg3ROT10rVFDyDJQ) |                                                              |\n| 38   | [报数](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FDKXJR8pNX3fKGvtSn0TEjw)    |                                                              |\n| 41   | [缺失的第一个正数](\u003Chttps:\u002F\u002Fmp.weixin.qq.com\u002Fs?__biz=MzUyNjQxNjYyMg==&mid=2247486473&idx=3&sn=06bf5f9c17cd3cb328934acc698b0ec3&chksm=fa0e6388cd79ea9e30c67dd2e5251056d860ba45e1fcbbcd4524573072305396d06629312c91&token=1735603091&lang=zh_CN#rd>) |                                                              |\n| 66   | [加一](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第66号问题：加一.md) |                                                              |\n| 75   | [颜色分类](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第75号问题：颜色分类.md) | ![](https:\u002F\u002Fblog-1257126549.cos.ap-guangzhou.myqcloud.com\u002Fblog\u002Fehgxu.gif) |\n| 86   | [分割链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第86号问题：分割链表.md) |                                                              |\n| 92   | [反转链表 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第92号问题：反转链表II.md) |                                                              |\n| 94   | [二叉树的中序遍历](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第94号问题：二叉树的中序遍历.md) |                                                              |\n| 101  | [对称二叉树](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第101号问题：对称二叉树.md) |                                                              |\n| 102  | [二叉树的层序遍历](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第102号问题：二叉树的层序遍历.md) |                                                              |\n| 103  | [二叉树的锯齿形层次遍历](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第103号问题：二叉树的锯齿形层次遍历.md) |                                                              |\n| 107  | [二叉树的层次遍历 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第107号问题：二叉树的层次遍历II.md) |                                                              |\n| 118  | [杨辉三角](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第118号问题：杨辉三角.md) |                                                              |\n| 119  | [杨辉三角II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第119号问题：杨辉三角II.md) |                                                              |\n| 110  | [平衡二叉树](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第110号问题：平衡二叉树.md) |                                                              |\n| 121  | [买卖股票的最佳时机](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第121号问题：买卖股票的最佳时机.md) |                                                              |\n| 122  | [买卖股票的最佳时机II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第122号问题：买卖股票的最佳时机II.md) |                                                              |\n| 123  | [买卖股票的最佳时机III](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第123号问题：买卖股票的最佳时机III.md) |                                                              |\n| 125  | [验证回文串](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第125号问题：验证回文串.md) |                                                              |\n| 131  | [分割回文串](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第131号问题：分割回文串.md) |                                                              |\n| 136  | [只出现一次的数字](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第136号问题：只出现一次的数字.md) |                                                              |\n| 138  | [复制带随机指针](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第138号问题：复制带随机指针.md) |                                                              |\n| 139  | [单词拆分](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第139号问题：单词拆分.md) |                                                              |\n| 141  | [环形链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第141号问题：环形链表.md) |                                                              |\n| 144  | [二叉树的前序遍历](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第144号问题：二叉树的前序遍历.md) |                                                              |\n| 145  | [二叉树的后序遍历](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第145号问题：二叉树的后序遍历.md) |                                                              |\n| 146  | [LRU缓存机制](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第146号问题：LRU缓存机制.md) |                                                              |\n| 150  | [逆波兰表达式求值](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第150号问题：逆波兰表达式求值.md) |                                                              |\n| 153  | [寻找旋转排序数组中的最小值](\u003Chttps:\u002F\u002Fmp.weixin.qq.com\u002Fs?__biz=MzUyNjQxNjYyMg==&mid=2247486243&idx=3&sn=ed49d65662be56ca76753141b91ce6ef&chksm=fa0e64a2cd79edb4b64d11e3af5f0ee2f597bbd843d5f34a812ef70f0f97e190d381e77f05f8&token=387372133&lang=zh_CN#rd>) |                                                              |\n| 164  | [最大间距](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FxHxjCDdFZyCW2pnY6Cz8SQ) |                                                              |\n| 167  | [两数之和 II - 输入有序数组](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第167号问题：两数之和II-输入有序数组.md) |                                                              |\n| 169  | [求众数](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第169号问题：求众数.md) |                                                              |\n| 172  | [阶乘后的零](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第172号问题：阶乘后的零.md) |                                                              |\n| 187  | [重复的 DNA 序列](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第187号问题：重复的DNA序列.md) |                                                              |\n| 191  | [位1的个数](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第191号问题：位1的个数.md) |                                                              |\n| 199  | [二叉树的右视图](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第199号问题：二叉树的右视图.md) |                                                              |\n| 201  | [数字范围按位与](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第201号问题：数字范围按位与.md) |                                                              |\n| 203  | [移除链表元素](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第203号问题：移除链表元素.md) |                                                              |\n| 206  | [反转链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第206号问题：反转链表.md) |                                                              |\n| 209  | [长度最小的子数组](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第209号问题：长度最小的子数组.md) |                                                              |\n| 219  | [存在重复元素 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第219号问题：存在重复元素II.md) |                                                              |\n| 229  | [求众数II](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FObO4eQbjp1s1g_WXPkjixQ) |                                                              |\n| 231  | [2的幂](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第231号问题：2的幂.md) |                                                              |\n| 232  | [使用栈实现队列](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002Fj6w94_PjvsL9Dip_xBcqcg) |                                                              |\n| 237  | [删除链表中的节点](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002F2XdUeDNblryFpXpTUgsaMQ) |                                                              |\n| 239  | [滑动窗口最大值](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第239号问题：滑动窗口最大值.md) |                                                              |\n| 242  | [有效的字母异位词](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002Fo5HTxmOgpftSaQdebS9zyQ) |                                                              |\n| 268  | [缺失数字](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第268号问题：缺失数字.md) |                                                              |\n| 279  | [完全平方数](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第279号问题：完全平方数.md) |                                                              |\n| 283  | [移动零](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第283号问题：移动零.md) |                                                              |\n| 295  | [数据流的中位数](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第295号问题：数据流的中位数.md) |                                                              |\n| 301  | [删除无效的括号](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第301号问题：删除无效的括号.md) |                                                              |\n| 319  | [灯泡开关](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002Fu35RGvT5Bc2o7jM-Uu_ZYA) |                                                              |\n| 326  | [3 的幂](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第326号问题：3的幂.md) |                                                              |\n| 328  | [奇偶链表](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第328号问题：奇偶链表.md) |                                                              |\n| 342  | [4的幂](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第342号问题：4的幂.md) |                                                              |\n| 344  | [反转字符串](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第344号问题：反转字符串.md) |                                                              |\n| 347  | [前K个高频元素](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第347号问题：前K个高频元素.md) |                                                              |\n| 349  | [两个数组的交集](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第349号问题：两个数组的交集.md) |                                                              |\n| 350  | [两个数组的交集 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第350号问题：两个数组的交集II.md) |                                                              |\n| 445  | [两数相加 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第445号问题：两数相加II.md) |                                                              |\n| 447  | [回旋镖的数量](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第447号问题：回旋镖的数量.md) |                                                              |\n| 454  | [四数相加 II](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第454号问题：四数相加II.md) |                                                              |\n| 642  | [设计一个搜索自动完成系统](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第642号问题：设计一个搜索自动完成系统.md) |                                                              |\n| 690  | [员工的重要性](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第690号问题：员工的重要性.md) |                                                              |\n| 739  | [每日温度](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002F3kDSOHyd-qOw7apzj0Z9YQ) |                                                              |\n| 877  | [石子游戏](https:\u002F\u002Fgithub.com\u002FMisterBooo\u002FLeetCodeAnimation\u002Ftree\u002Fmaster\u002Fnotes\u002FLeetCode第877号问题：石子游戏.md) |                                                              |\n| 1025 | [除数博弈](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002F0u6z02QYj1OpAwf54k8-Dw) |                                                              |\n| 1099 | [小于 K 的两数之和](https:\u002F\u002Fmp.weixin.qq.com\u002Fs\u002FS6BbLeP_th_9JheNX7NN-w) |                                                              |\n\n\n\n\n\n![](Pictures\u002Fqrcode.jpg)\n\n\n","LeetCodeAnimation 项目通过动画形式展示了 LeetCode 上题目的解题思路。该项目使用 Java 编程语言，旨在帮助用户更直观地理解算法和数据结构的实现过程。其核心功能包括对 LeetCode 题目进行详细的动画演示，并提供了易于理解的分析与配图，特别适合初学者入门学习以及有经验的开发者巩固基础。此项目非常适合准备技术面试、算法学习或教学场景使用。",2,"2026-06-17 02:35:31","top_all"]