{"id":16099312,"url":"https://github.com/googtech/leetcode","last_synced_at":"2025-03-18T07:31:02.098Z","repository":{"id":107662566,"uuid":"275879859","full_name":"GoogTech/leetcode","owner":"GoogTech","description":"☕ The learning note about data structures, algorithms, and leetcode problems, which are based on java、python、golang, and c++.","archived":false,"fork":false,"pushed_at":"2021-09-15T01:57:49.000Z","size":10660,"stargazers_count":11,"open_issues_count":3,"forks_count":4,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-28T08:04:42.644Z","etag":null,"topics":["algorithms-and-data-structures","c-plus-plus","gitbook","golang","java","leetcode","note","python"],"latest_commit_sha":null,"homepage":"https://goog.tech/leetcode","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GoogTech.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","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},"funding":{"custom":["https://goog.tech/leetcode/sponsor.png"]}},"created_at":"2020-06-29T17:14:25.000Z","updated_at":"2024-08-09T09:32:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"90ce6d14-6dd5-4d8d-aa22-1f087867dd59","html_url":"https://github.com/GoogTech/leetcode","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GoogTech%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GoogTech%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GoogTech%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GoogTech%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GoogTech","download_url":"https://codeload.github.com/GoogTech/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243910776,"owners_count":20367545,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["algorithms-and-data-structures","c-plus-plus","gitbook","golang","java","leetcode","note","python"],"created_at":"2024-10-09T18:26:47.275Z","updated_at":"2025-03-18T07:31:02.086Z","avatar_url":"https://github.com/GoogTech.png","language":"Java","funding_links":["https://goog.tech/leetcode/sponsor.png"],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n\t\u003ca href=\"https://leetcode.goog.tech\"\u003e\u003cimg src=\"https://goog.tech/leetcode/leetcode-googtech-logo.PNG\" width=\"360\"\u003e\u003c/a\u003e\n\n\u003cp align=\"center\"\u003e\n   \u003cimg height=\"50px\" src=\"https://cdn.svgporn.com/logos/gopher.svg\"\u003e\n   \u003cimg height=\"50px\" src=\"https://cdn.svgporn.com/logos/python.svg\"\u003e\n   \u003cimg height=\"50px\" src=\"https://cdn.svgporn.com/logos/java.svg\"\u003e\n   \u003cimg height=\"50px\" src=\"https://cdn.svgporn.com/logos/c-plusplus.svg\"\u003e\n   \u003cimg height=\"50px\" src=\"https://cdn.svgporn.com/logos/javascript.svg\"\u003e\n   \u003c/br\u003e\n   \u003c/br\u003e\n   \u003cimg src=\"http://profile-counter.glitch.me/leetcode.goog.tech/count.svg\" width=\"360\"\u003e\n   \u003c/br\u003e\n   \u003c/br\u003e\n    \n   \u003ca href=\"https://www.codacy.com/manual/gentleman_0109/leetcode-googtech?utm_source=github.com\u0026amp;utm_medium=referral\u0026amp;utm_content=YUbuntu0109/leetcode-googtech\u0026amp;utm_campaign=Badge_Grade\"\u003e\n        \u003cimg src=\"https://app.codacy.com/project/badge/Grade/4d3b1197a1ff458dab972933dcf0a857\"/\u003e\n    \u003c/a\u003e\n    \u003ca rel=\"travis-ci\" href=\"https://travis-ci.com/github/GoogTech/leetcode-googtech\"\u003e\n\t    \u003cimg src=\"https://travis-ci.com/GoogTech/leetcode-googtech.svg?branch=master\"\u003e\u003c/img\u003e\n    \u003c/a\u003e\n    \u003cimg src=\"https://img.shields.io/github/commit-activity/m/YUbuntu0109/leetcode-googtech?color=ff69b4\"\u003e\u003c/img\u003e\n    \u003cimg src=\"https://img.shields.io/github/license/YUbuntu0109/leetcode-googtech.svg\"\u003e\u003c/img\u003e\n    \u003ca rel=\"license\" href=\"http://creativecommons.org/licenses/by-nc-sa/4.0/\"\u003e\n        \u003cimg alt=\"知识共享许可协议\" style=\"border-width:0\" height=\"21\" src=\"https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png\"/\u003e\n    \u003c/a\u003e\n    \u003cimg src=\"https://img.shields.io/github/repo-size/YUbuntu0109/leetcode-googtech\"\u003e\u003c/img\u003e\n    \u003cimg src=\"https://img.shields.io/github/stars/YUbuntu0109/leetcode-googtech.svg\"\u003e\u003c/img\u003e\n\u003c/p\u003e\n\n\u003c/br\u003e\n\u003cp align=\"center\"\u003e\n    \u003ca style=\"font-size:30px\" href=\"https://space.bilibili.com/364361791/channel/detail?cid=141283\"\u003e\n        😎 大三狗带你从零开始刷LeetCode !\n        \u003cimg src=\"https://goog.tech/leetcode/cover-of-leetcode-vlog.png\"\u003e\n    \u003c/a\u003e\n\u003c/p\u003e\n\n\u003c!-- 记得设计贡献方案后修改 href --\u003e\n\u003c!--\n\u003cp align=\"center\"\u003e\n    \u003ca href=\"https://ishacker.net/about/\"\u003e✋ Hey bro let's make the algorithm to understand easily\u003c/a\u003e\n\u003c/p\u003e\n--\u003e\n\n\n## Tags\n[![tag](https://img.shields.io/badge/-数组-red?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-字符串-yellow?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-递归-blue?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n\n[![tag](https://img.shields.io/badge/-栈-green?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-链表-pink?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-哈希表-brown?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-贪心算法-purple?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n\n[![tag](https://img.shields.io/badge/-双指针法-orange?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-树-cyan?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-图与搜索-gray?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-二分查找-red?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-二进制运算-yellow?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n\n[![tag](https://img.shields.io/badge/-数与位-blue?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-动态规划-green?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-队列-pink?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-堆-brown?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-排序算法-purple?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-深度优先搜索-orange?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n[![tag](https://img.shields.io/badge/-广度优先搜索-cyan?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=white)](https://algorithm.show/)\n\n\n## Summary\n\n* [简介](docs/README.md)\n* [必学知识点](docs/算法入门必须知识点/README.md)\n    * [C 语言实现](docs/算法入门必须知识点/C语言实现/README.md)\n        * [待更新···](docs/算法入门必须知识点/C语言实现/待更新.md)\n    * [Python 语言实现](docs/算法入门必须知识点/Python语言实现/README.md)\n        * [栈](docs/算法入门必须知识点/Python语言实现/栈/栈.md)\n        * [链表](docs/算法入门必须知识点/Python语言实现/链表/README.md)\n            * [无序链表](docs/算法入门必须知识点/Python语言实现/链表/无序链表/无序链表.md)\n        * [搜索](docs/算法入门必须知识点/Python语言实现/搜索/README.md)\n            * [二分搜索](docs/算法入门必须知识点/Python语言实现/搜索/二分搜索/二分搜索.md)\n            * [顺序搜索](docs/算法入门必须知识点/Python语言实现/搜索/顺序搜索/顺序搜索.md)\n        * [排序](docs/算法入门必须知识点/Python语言实现/排序/README.md)\n            * [冒泡排序](docs/算法入门必须知识点/Python语言实现/排序/冒泡排序/冒泡排序.md)\n            * [选择排序](docs/算法入门必须知识点/Python语言实现/排序/选择排序/选择排序.md)\n            * [插入排序](docs/算法入门必须知识点/Python语言实现/排序/插入排序/插入排序.md)\n    * [Java 语言实现](docs/算法入门必须知识点/Java语言实现/README.md)\n        * [链表](docs/算法入门必须知识点/Java语言实现/链表/README.md)\n            * [单向链表](docs/算法入门必须知识点/Java语言实现/链表/单向链表/单向链表.md)\n\n* [LeetCode](docs/LeetCode刷题之旅及题目解析/README.md)\n    * [1.两数之和](docs/LeetCode刷题之旅及题目解析/1.两数之和/1.两数之和.md)\n    * [2.两数相加](docs/LeetCode刷题之旅及题目解析/2.两数相加/2.两数相加.md)\n    * [9.回文数](docs/LeetCode刷题之旅及题目解析/9.回文数/9.回文数.md)\n    * [11.盛最多水的容器](docs/LeetCode刷题之旅及题目解析/11.盛最多水的容器/11.盛最多水的容器.md)\n    * [14.最长公共前缀](docs/LeetCode刷题之旅及题目解析/14.最长公共前缀/14.最长公共前缀.md)\n    * [19.删除链表的倒数第N个节点](docs/LeetCode刷题之旅及题目解析/19.删除链表的倒数第N个节点/19.删除链表的倒数第N个节点.md)\n    * [20.有效的括号](docs/LeetCode刷题之旅及题目解析/20.有效的括号/20.有效的括号.md)\n    * [21.合并两个有序链表](docs/LeetCode刷题之旅及题目解析/21.合并两个有序链表/21.合并两个有序链表.md)\n    * [26.删除排序数组中的重复项](docs/LeetCode刷题之旅及题目解析/26.删除排序数组中的重复项/26.删除排序数组中的重复项.md)\n    * [27.移除元素](docs/LeetCode刷题之旅及题目解析/27.移除元素/27.移除元素.md)\n    * [28.实现strStr(docs/)](docs/LeetCode刷题之旅及题目解析/28.实现strStr/28.实现strStr.md)\n    * [35.搜索插入位置](docs/LeetCode刷题之旅及题目解析/35.搜索插入位置/35.搜索插入位置.md)\n    * [41.缺失的第一个正数](docs/LeetCode刷题之旅及题目解析/41.缺失的第一个正数/41.缺失的第一个正数.md)\n    * [53.最大子序和](docs/LeetCode刷题之旅及题目解析/53.最大子序和/53.最大子序和.md)\n    * [58.最后一个单词的长度](docs/LeetCode刷题之旅及题目解析/58.最后一个单词的长度/58.最后一个单词的长度.md)\n    * [66.加一](docs/LeetCode刷题之旅及题目解析/66.加一/66.加一.md)\n    * [70.爬楼梯](docs/LeetCode刷题之旅及题目解析/70.爬楼梯/70.爬楼梯.md)\n    * [82.删除排序链表中的重复元素II](docs/LeetCode刷题之旅及题目解析/82.删除排序链表中的重复元素II/82.删除排序链表中的重复元素II.md)\n    * [83.删除排序链表中的重复元素](docs/LeetCode刷题之旅及题目解析/83.删除排序链表中的重复元素/83.删除排序链表中的重复元素.md)\n    * [88.合并两个有序数组](docs/LeetCode刷题之旅及题目解析/88.合并两个有序数组/88.合并两个有序数组.md)\n    * [94.二叉树的中序遍历](docs/LeetCode刷题之旅及题目解析/94.二叉树的中序遍历/94.二叉树的中序遍历.md)\n    * [94.144.145.二叉树的前中后序遍历模板](docs/LeetCode刷题之旅及题目解析/94.144.145.二叉树的前中后序遍历模板/94.144.145.二叉树的前中后序遍历模板.md)\n    * [100.相同的树](docs/LeetCode刷题之旅及题目解析/100.相同的树/100.相同的树.md)\n    * [101.对称二叉树](docs/LeetCode刷题之旅及题目解析/101.对称二叉树/101.对称二叉树.md)\n    * [102.二叉树的层序遍历](docs/LeetCode刷题之旅及题目解析/102.二叉树的层序遍历/102.二叉树的层序遍历.md)\n    * [104.二叉树的最大深度](docs/LeetCode刷题之旅及题目解析/104.二叉树的最大深度/104.二叉树的最大深度.md)\n    * [107.二叉树的层次遍历II](docs/LeetCode刷题之旅及题目解析/107.二叉树的层次遍历II/107.二叉树的层次遍历II.md)\n    * [108.将有序数组转换为二叉搜索树](docs/LeetCode刷题之旅及题目解析/108.将有序数组转换为二叉搜索树/108.将有序数组转换为二叉搜索树.md)\n    * [109.有序链表转换二叉搜索树](docs/LeetCode刷题之旅及题目解析/109.有序链表转换二叉搜索树/109.有序链表转换二叉搜索树.md)\n    * [110.平衡二叉树](docs/LeetCode刷题之旅及题目解析/110.平衡二叉树/110.平衡二叉树.md)\n    * [111.二叉树的最小深度](docs/LeetCode刷题之旅及题目解析/111.二叉树的最小深度/111.二叉树的最小深度.md)\n    * [121.买卖股票的最佳时机](docs/LeetCode刷题之旅及题目解析/121.买卖股票的最佳时机/121.买卖股票的最佳时机.md)\n    * [125.验证回文串](docs/LeetCode刷题之旅及题目解析/125.验证回文串/125.验证回文串.md)\n    * [136.只出现一次的数字](docs/LeetCode刷题之旅及题目解析/136.只出现一次的数字/136.只出现一次的数字.md)\n    * [137.只出现一次的数字II](docs/LeetCode刷题之旅及题目解析/137.只出现一次的数字II/137.只出现一次的数字II.md)\n    * [141.环形链表](docs/LeetCode刷题之旅及题目解析/141.环形链表/141.环形链表.md)\n    * [144.二叉树的前序遍历](docs/LeetCode刷题之旅及题目解析/144.二叉树的前序遍历/144.二叉树的前序遍历.md)\n    * [145.二叉树的后序遍历](docs/LeetCode刷题之旅及题目解析/145.二叉树的后序遍历/145.二叉树的后序遍历.md)\n    * [151.翻转字符串里的单词](docs/LeetCode刷题之旅及题目解析/151.翻转字符串里的单词/151.翻转字符串里的单词.md)\n    * [155.最小栈](docs/LeetCode刷题之旅及题目解析/155.最小栈/155.最小栈.md)\n    * [160.相交链表](docs/LeetCode刷题之旅及题目解析/160.相交链表/160.相交链表.md)\n    * [165.比较版本号](docs/LeetCode刷题之旅及题目解析/165.比较版本号/165.比较版本号.md)\n    * [167.两数之和II-输入有序数组](docs/LeetCode刷题之旅及题目解析/167.两数之和II-输入有序数组/167.两数之和II-输入有序数组.md)\n    * [173.二叉搜索树迭代器](docs/LeetCode刷题之旅及题目解析/173.二叉搜索树迭代器/173.二叉搜索树迭代器.md)\n    * [182.查找重复的电子邮箱](docs/LeetCode刷题之旅及题目解析/182.查找重复的电子邮箱/182.查找重复的电子邮箱.md)\n    * [191.位1的个数](docs/LeetCode刷题之旅及题目解析/191.位1的个数/191.位1的个数.md)\n    * [198.打家劫舍](docs/LeetCode刷题之旅及题目解析/198.打家劫舍/198.打家劫舍.md)\n    * [199.二叉树的右视图](docs/LeetCode刷题之旅及题目解析/199.二叉树的右视图/199.二叉树的右视图.md)\n    * [203.移除链表元素](docs/LeetCode刷题之旅及题目解析/203.移除链表元素/203.移除链表元素.md)\n    * [206.反转链表](docs/LeetCode刷题之旅及题目解析/206.反转链表/206.反转链表.md)\n    * [217.存在重复元素](docs/LeetCode刷题之旅及题目解析/217.存在重复元素/217.存在重复元素.md)\n    * [222.完全二叉树的节点个数](docs/LeetCode刷题之旅及题目解析/222.完全二叉树的节点个数/222.完全二叉树的节点个数.md)\n    * [225.用队列实现栈](docs/LeetCode刷题之旅及题目解析/225.用队列实现栈/225.用队列实现栈.md)\n    * [226.翻转二叉树](docs/LeetCode刷题之旅及题目解析/226.翻转二叉树/226.翻转二叉树.md)\n    * [230.二叉搜索树中第K小的元素](docs/LeetCode刷题之旅及题目解析/230.二叉搜索树中第K小的元素/230.二叉搜索树中第K小的元素.md)\n    * [232.用栈实现队列](docs/LeetCode刷题之旅及题目解析/232.用栈实现队列/232.用栈实现队列.md)\n    * [234.回文链表](docs/LeetCode刷题之旅及题目解析/234.回文链表/234.回文链表.md)\n    * [237.删除链表中的节点](docs/LeetCode刷题之旅及题目解析/237.删除链表中的节点/237.删除链表中的节点.md)\n    * [242.有效的字母异位词](docs/LeetCode刷题之旅及题目解析/242.有效的字母异位词/242.有效的字母异位词.md)\n    * [257.二叉树的所有路径](docs/LeetCode刷题之旅及题目解析/257.二叉树的所有路径/257.二叉树的所有路径.md)\n    * [258.各位相加](docs/LeetCode刷题之旅及题目解析/258.各位相加/258.各位相加.md)\n    * [260.只出现一次的数字III](docs/LeetCode刷题之旅及题目解析/260.只出现一次的数字III/260.只出现一次的数字III.md)\n    * [283.移动零](docs/LeetCode刷题之旅及题目解析/283.移动零/283.移动零.md)\n    * [303.区域和检索-数组不可变](docs/LeetCode刷题之旅及题目解析/303.区域和检索-数组不可变/303.区域和检索-数组不可变.md)\n    * [344.反转字符串](docs/LeetCode刷题之旅及题目解析/344.反转字符串/344.反转字符串.md)\n    * [345.反转字符串中的元音字母](docs/LeetCode刷题之旅及题目解析/345.反转字符串中的元音字母/345.反转字符串中的元音字母.md)\n    * [349.两个数组的交集](docs/LeetCode刷题之旅及题目解析/349.两个数组的交集/349.两个数组的交集.md)\n    * [350.两个数组的交集II](docs/LeetCode刷题之旅及题目解析/350.两个数组的交集II/350.两个数组的交集II.md)\n    * [383.赎金信](docs/LeetCode刷题之旅及题目解析/383.赎金信/383.赎金信.md)\n    * [387.字符串中的第一个唯一字符](docs/LeetCode刷题之旅及题目解析/387.字符串中的第一个唯一字符/387.字符串中的第一个唯一字符.md)\n    * [389.找不同](docs/LeetCode刷题之旅及题目解析/389.找不同/389.找不同.md)\n    * [392.判断子序列](docs/LeetCode刷题之旅及题目解析/392.判断子序列/392.判断子序列.md)\n    * [414.第三大的数](docs/LeetCode刷题之旅及题目解析/414.第三大的数/414.第三大的数.md)\n    * [415.字符串相加](docs/LeetCode刷题之旅及题目解析/415.字符串相加/415.字符串相加.md)\n    * [429.N叉树的层序遍历](docs/LeetCode刷题之旅及题目解析/429.N叉树的层序遍历/429.N叉树的层序遍历.md)\n    * [434.字符串中的单词数](docs/LeetCode刷题之旅及题目解析/434.字符串中的单词数/434.字符串中的单词数.md)\n    * [442.数组中重复的数据](docs/LeetCode刷题之旅及题目解析/442.数组中重复的数据/442.数组中重复的数据.md)\n    * [448.找到所有数组中消失的数字](docs/LeetCode刷题之旅及题目解析/448.找到所有数组中消失的数字/448.找到所有数组中消失的数字.md)\n    * [453.最小移动次数使数组元素相等](docs/LeetCode刷题之旅及题目解析/453.最小移动次数使数组元素相等/453.最小移动次数使数组元素相等.md)\n    * [459.重复的子字符串](docs/LeetCode刷题之旅及题目解析/459.重复的子字符串/459.重复的子字符串.md)\n    * [485.最大连续1的个数](docs/LeetCode刷题之旅及题目解析/485.最大连续1的个数/485.最大连续1的个数.md)\n    * [492.构造矩形](docs/LeetCode刷题之旅及题目解析/492.构造矩形/492.构造矩形.md)\n    * [496.下一个更大元素I](docs/LeetCode刷题之旅及题目解析/496.下一个更大元素I/496.下一个更大元素I.md)\n    * [503.下一个更大元素II](docs/LeetCode刷题之旅及题目解析/503.下一个更大元素II/503.下一个更大元素II.md)\n    * [513.找树左下角的值](docs/LeetCode刷题之旅及题目解析/513.找树左下角的值/513.找树左下角的值.md)\n    * [515.在每个树行中找最大值](docs/LeetCode刷题之旅及题目解析/515.在每个树行中找最大值/515.在每个树行中找最大值.md)\n    * [520.检测大写字母](docs/LeetCode刷题之旅及题目解析/520.检测大写字母/520.检测大写字母.md)\n    * [521.最长特殊序列Ⅰ](docs/LeetCode刷题之旅及题目解析/521.最长特殊序列Ⅰ/521.最长特殊序列Ⅰ.md)\n    * [530.二叉搜索树的最小绝对差](docs/LeetCode刷题之旅及题目解析/530.二叉搜索树的最小绝对差/530.二叉搜索树的最小绝对差.md)\n    * [532.数组中的K-diff数对](docs/LeetCode刷题之旅及题目解析/532.数组中的K-diff数对/532.数组中的K-diff数对.md)\n    * [538.把二叉搜索树转换为累加树](docs/LeetCode刷题之旅及题目解析/538.把二叉搜索树转换为累加树/538.把二叉搜索树转换为累加树.md)\n    * [557.反转字符串中的单词III](docs/LeetCode刷题之旅及题目解析/557.反转字符串中的单词III/557.反转字符串中的单词III.md)\n    * [559.N叉树的最大深度](docs/LeetCode刷题之旅及题目解析/559.N叉树的最大深度/559.N叉树的最大深度.md)\n    * [561.数组拆分I](docs/LeetCode刷题之旅及题目解析/561.数组拆分I/561.数组拆分I.md)\n    * [589.N叉树的前序遍历](docs/LeetCode刷题之旅及题目解析/589.N叉树的前序遍历/589.N叉树的前序遍历.md)\n    * [590.N叉树的后序遍历](docs/LeetCode刷题之旅及题目解析/590.N叉树的后序遍历/590.N叉树的后序遍历.md)\n    * [595.大的国家](docs/LeetCode刷题之旅及题目解析/595.大的国家/595.大的国家.md)\n    * [617.合并二叉树](docs/LeetCode刷题之旅及题目解析/617.合并二叉树/617.合并二叉树.md)\n    * [622.设计循环队列](docs/LeetCode刷题之旅及题目解析/622.设计循环队列/622.设计循环队列.md)\n    * [627.交换工资](docs/LeetCode刷题之旅及题目解析/627.交换工资/627.交换工资.md)\n    * [628.三个数的最大乘积](docs/LeetCode刷题之旅及题目解析/628.三个数的最大乘积/628.三个数的最大乘积.md)\n    * [641.设计循环双端队列](docs/LeetCode刷题之旅及题目解析/641.设计循环双端队列/641.设计循环双端队列.md)\n    * [645.错误的集合](docs/LeetCode刷题之旅及题目解析/645.错误的集合/645.错误的集合.md)\n    * [657.机器人能否返回原点](docs/LeetCode刷题之旅及题目解析/657.机器人能否返回原点/657.机器人能否返回原点.md)\n    * [680.验证回文字符串Ⅱ](docs/LeetCode刷题之旅及题目解析/680.验证回文字符串Ⅱ/680.验证回文字符串Ⅱ.md)\n    * [682.棒球比赛](docs/LeetCode刷题之旅及题目解析/682.棒球比赛/682.棒球比赛.md)\n    * [690.员工的重要性](docs/LeetCode刷题之旅及题目解析/690.员工的重要性/690.员工的重要性.md)\n    * [700.二叉搜索树中的搜索](docs/LeetCode刷题之旅及题目解析/700.二叉搜索树中的搜索/700.二叉搜索树中的搜索.md)\n    * [709.转换成小写字母](docs/LeetCode刷题之旅及题目解析/709.转换成小写字母/709.转换成小写字母.md)\n    * [746.使用最小花费爬楼梯](docs/LeetCode刷题之旅及题目解析/746.使用最小花费爬楼梯/746.使用最小花费爬楼梯.md)\n    * [783.二叉搜索树节点最小距离](docs/LeetCode刷题之旅及题目解析/783.二叉搜索树节点最小距离/783.二叉搜索树节点最小距离.md)\n    * [804.唯一摩尔斯密码词](docs/LeetCode刷题之旅及题目解析/804.唯一摩尔斯密码词/804.唯一摩尔斯密码词.md)\n    * [844.比较含退格的字符串](docs/LeetCode刷题之旅及题目解析/844.比较含退格的字符串/844.比较含退格的字符串.md)\n    * [872.叶子相似的树](docs/LeetCode刷题之旅及题目解析/872.叶子相似的树/872.叶子相似的树.md)\n    * [876.链表的中间结点](docs/LeetCode刷题之旅及题目解析/876.链表的中间结点/876.链表的中间结点.md)\n    * [897.递增顺序查找树](docs/LeetCode刷题之旅及题目解析/897.递增顺序查找树/897.递增顺序查找树.md)\n    * [905.按奇偶排序数组](docs/LeetCode刷题之旅及题目解析/905.按奇偶排序数组/905.按奇偶排序数组.md)\n    * [917.仅仅反转字母](docs/LeetCode刷题之旅及题目解析/917.仅仅反转字母/917.仅仅反转字母.md)\n    * [921.使括号有效的最少添加](docs/LeetCode刷题之旅及题目解析/921.使括号有效的最少添加/921.使括号有效的最少添加.md)\n    * [922.按奇偶排序数组II](docs/LeetCode刷题之旅及题目解析/922.按奇偶排序数组II/922.按奇偶排序数组II.md)\n    * [925.长按键入](docs/LeetCode刷题之旅及题目解析/925.长按键入/925.长按键入.md)\n    * [929.独特的电子邮件地址](docs/LeetCode刷题之旅及题目解析/929.独特的电子邮件地址/929.独特的电子邮件地址.md)\n    * [933.最近的请求次数](docs/LeetCode刷题之旅及题目解析/933.最近的请求次数/933.最近的请求次数.md)\n    * [938.二叉搜索树的范围和](docs/LeetCode刷题之旅及题目解析/938.二叉搜索树的范围和/938.二叉搜索树的范围和.md)\n    * [977.有序数组的平方](docs/LeetCode刷题之旅及题目解析/977.有序数组的平方/977.有序数组的平方.md)\n    * [993.二叉树的堂兄弟节点](docs/LeetCode刷题之旅及题目解析/993.二叉树的堂兄弟节点/993.二叉树的堂兄弟节点.md)\n    * [1021.删除最外层的括号](docs/LeetCode刷题之旅及题目解析/1021.删除最外层的括号/1021.删除最外层的括号.md)\n    * [1047.删除字符串中的所有相邻重复项](docs/LeetCode刷题之旅及题目解析/1047.删除字符串中的所有相邻重复项/1047.删除字符串中的所有相邻重复项.md)\n    * [1108.IP地址无效化](docs/LeetCode刷题之旅及题目解析/1108.IP地址无效化/1108.IP地址无效化.md)\n    * [1207.独一无二的出现次数](docs/LeetCode刷题之旅及题目解析/1207.独一无二的出现次数/1207.独一无二的出现次数.md)\n    * [1221.分割平衡字符串](docs/LeetCode刷题之旅及题目解析/1221.分割平衡字符串/1221.分割平衡字符串.md)\n    * [1281.整数的各位积和之差](docs/LeetCode刷题之旅及题目解析/1281.整数的各位积和之差/1281.整数的各位积和之差.md)\n    * [1290.二进制链表转整数](docs/LeetCode刷题之旅及题目解析/1290.二进制链表转整数/1290.二进制链表转整数.md)\n    * [1295.统计位数为偶数的数字](docs/LeetCode刷题之旅及题目解析/1295.统计位数为偶数的数字/1295.统计位数为偶数的数字.md)\n    * [1299.将每个元素替换为右侧最大元素](docs/LeetCode刷题之旅及题目解析/1299.将每个元素替换为右侧最大元素/1299.将每个元素替换为右侧最大元素.md)\n    * [1302.层数最深叶子节点的和](docs/LeetCode刷题之旅及题目解析/1302.层数最深叶子节点的和/1302.层数最深叶子节点的和.md)\n    * [1305.两棵二叉搜索树中的所有元素](docs/LeetCode刷题之旅及题目解析/1305.两棵二叉搜索树中的所有元素/1305.两棵二叉搜索树中的所有元素.md)\n    * [1309.解码字母到整数映射](docs/LeetCode刷题之旅及题目解析/1309.解码字母到整数映射/1309.解码字母到整数映射.md)\n    * [1315.祖父节点值为偶数的节点和](docs/LeetCode刷题之旅及题目解析/1315.祖父节点值为偶数的节点和/1315.祖父节点值为偶数的节点和.md)\n    * [1323.6和9组成的最大数字](docs/LeetCode刷题之旅及题目解析/1323.6和9组成的最大数字/1323.6和9组成的最大数字.md)\n    * [1332.删除回文子序列](docs/LeetCode刷题之旅及题目解析/1332.删除回文子序列/1332.删除回文子序列.md)\n    * [1342.将数字变成 0 的操作次数](docs/LeetCode刷题之旅及题目解析/1342.将数字变成0的操作次数/1342.将数字变成0的操作次数.md)\n    * [1374.生成每种字符都是奇数个的字符串](docs/LeetCode刷题之旅及题目解析/1374.生成每种字符都是奇数个的字符串/1374.生成每种字符都是奇数个的字符串.md)\n    * [1381.设计一个支持增量操作的栈](docs/LeetCode刷题之旅及题目解析/1381.设计一个支持增量操作的栈/1381.设计一个支持增量操作的栈.md)\n    * [1436.旅行终点站](docs/LeetCode刷题之旅及题目解析/1436.旅行终点站/1436.旅行终点站.md)\n    * [1441.用栈操作构建数组](docs/LeetCode刷题之旅及题目解析/1441.用栈操作构建数组/1441.用栈操作构建数组.md)\n    * [1448.统计二叉树中好节点的数目](docs/LeetCode刷题之旅及题目解析/1448.统计二叉树中好节点的数目/1448.统计二叉树中好节点的数目.md)\n    * [1455.检查单词是否为句中其他单词的前缀](docs/LeetCode刷题之旅及题目解析/1455.检查单词是否为句中其他单词的前缀/1455.检查单词是否为句中其他单词的前缀.md)\n    * [1464.数组中两元素的最大乘积](docs/LeetCode刷题之旅及题目解析/1464.数组中两元素的最大乘积/1464.数组中两元素的最大乘积.md)\n    * [1470.重新排列数组](docs/LeetCode刷题之旅及题目解析/1470.重新排列数组/1470.重新排列数组.md)\n    * [1480.一维数组的动态和](docs/LeetCode刷题之旅及题目解析/1480.一维数组的动态和/1480.一维数组的动态和.md)\n    * [1486.数组异或操作](docs/LeetCode刷题之旅及题目解析/1486.数组异或操作/1486.数组异或操作.md)\n    * [1491.去掉最低工资和最高工资后的工资平均值](docs/LeetCode刷题之旅及题目解析/1491.去掉最低工资和最高工资后的工资平均值/1491.去掉最低工资和最高工资后的工资平均值.md)\n    * [1502.判断能否形成等差数列](docs/LeetCode刷题之旅及题目解析/1502.判断能否形成等差数列/1502.判断能否形成等差数列.md)\n    * [1512.好数对的数目](docs/LeetCode刷题之旅及题目解析/1512.好数对的数目/1512.好数对的数目.md)\n    * [1518.换酒问题](docs/LeetCode刷题之旅及题目解析/1518.换酒问题/1518.换酒问题.md)\n    * [1528.重新排列字符串](docs/LeetCode刷题之旅及题目解析/1528.重新排列字符串/1528.重新排列字符串.md)\n    * [1544.整理字符串](docs/LeetCode刷题之旅及题目解析/1544.整理字符串/1544.整理字符串.md)\n    * [1557.可以到达所有点的最少点数目](docs/LeetCode刷题之旅及题目解析/1557.可以到达所有点的最少点数目/1557.可以到达所有点的最少点数目.md)\n\n* [面试题](docs/面试题/README.md)\n    * [面试题01](docs/面试题/面试题01/README.md)\n        * [02.判定是否互为字符重排](docs/面试题/面试题01/02.判定是否互为字符重排/02.判定是否互为字符重排.md)\n    * [面试题02](docs/面试题/面试题02/README.md)\n        * [01.移除重复节点](docs/面试题/面试题02/01.移除重复节点/01.移除重复节点.md)\n        * [02.返回倒数第k个节点](docs/面试题/面试题02/02.返回倒数第k个节点/02.返回倒数第k个节点.md)\n        * [03.删除中间节点](docs/面试题/面试题02/03.删除中间节点/03.删除中间节点.md)\n        * [06.回文链表](docs/面试题/面试题02/06.回文链表/06.回文链表.md)\n        * [07.链表相交](docs/面试题/面试题02/07.链表相交/07.链表相交.md)\n    * [面试题03](docs/面试题/面试题03/README.md)\n        * [02.栈的最小值](docs/面试题/面试题03/02.栈的最小值/02.栈的最小值.md)\n        * [04.化栈为队](docs/面试题/面试题03/04.化栈为队/04.化栈为队.md)\n    * [面试题04](docs/面试题/面试题04/README.md)\n        * [02.最小高度树](docs/面试题/面试题04/02.最小高度树/02.最小高度树.md)\n        * [03.特定深度节点链表](docs/面试题/面试题04/03.特定深度节点链表/03.特定深度节点链表.md)\n    * [面试题10](docs/面试题/面试题10/README.md)\n        * [01.合并排序的数组](docs/面试题/面试题10/01.合并排序的数组/01.合并排序的数组.md)\n    * [面试题17](docs/面试题/面试题17/README.md)\n        * [11.单词距离](docs/面试题/面试题17/11.单词距离/11.单词距离.md)\n        * [16.按摩师](docs/面试题/面试题17/16.按摩师/16.按摩师.md)\n  \n* [剑指 Offer](docs/剑指Offer/README.md)\n    * [03.数组中重复的数字](docs/剑指Offer/03.数组中重复的数字/03.数组中重复的数字.md)\n    * [04.二维数组中的查找](docs/剑指Offer/04.二维数组中的查找/04.二维数组中的查找.md)\n    * [05.替换空格](docs/剑指Offer/05.替换空格/05.替换空格.md)\n    * [06.从尾到头打印链表](docs/剑指Offer/06.从尾到头打印链表/06.从尾到头打印链表.md)\n    * [15.二进制中1的个数](docs/剑指Offer/15.二进制中1的个数/15.二进制中1的个数.md)\n    * [17.打印从1到最大的n位数](docs/剑指Offer/17.打印从1到最大的n位数/17.打印从1到最大的n位数.md)\n    * [18.删除链表的节点](docs/剑指Offer/18.删除链表的节点/18.删除链表的节点.md)\n    * [21.调整数组顺序使奇数位于偶数前面](docs/剑指Offer/21.调整数组顺序使奇数位于偶数前面/21.调整数组顺序使奇数位于偶数前面.md)\n    * [22.链表中倒数第k个节点](docs/剑指Offer/22.链表中倒数第k个节点/22.链表中倒数第k个节点.md)\n    * [24.反转链表](docs/剑指Offer/24.反转链表/24.反转链表.md)\n    * [25.合并两个排序的链表](docs/剑指Offer/25.合并两个排序的链表/25.合并两个排序的链表.md)\n    * [27.二叉树的镜像](docs/剑指Offer/27.二叉树的镜像/27.二叉树的镜像.md)\n    * [28.对称的二叉树](docs/剑指Offer/28.对称的二叉树/28.对称的二叉树.md)\n    * [30.包含min函数的栈](docs/剑指Offer/30.包含min函数的栈/30.包含min函数的栈.md)\n    * [32-I.从上到下打印二叉树](docs/剑指Offer/32-I.从上到下打印二叉树/32-I.从上到下打印二叉树.md)\n    * [32-II.从上到下打印二叉树II](docs/剑指Offer/32-II.从上到下打印二叉树II/32-II.从上到下打印二叉树II.md)\n    * [32-III.从上到下打印二叉树III](docs/剑指Offer/32-III.从上到下打印二叉树III/32-III.从上到下打印二叉树III.md)\n    * [50.第一个只出现一次的字符](docs/剑指Offer/50.第一个只出现一次的字符/50.第一个只出现一次的字符.md)\n    * [52.两个链表的第一个公共节点](docs/剑指Offer/52.两个链表的第一个公共节点/52.两个链表的第一个公共节点.md)\n    * [54.二叉搜索树的第k大节点](docs/剑指Offer/54.二叉搜索树的第k大节点/54.二叉搜索树的第k大节点.md)\n    * [55-I.二叉树的深度](docs/剑指Offer/55-I.二叉树的深度/55-I.二叉树的深度.md)\n    * [55-II.平衡二叉树](docs/剑指Offer/55-II.平衡二叉树/55-II.平衡二叉树.md)\n    * [57.和为s的两个数字](docs/剑指Offer/57.和为s的两个数字/57.和为s的两个数字.md)\n    * [58-I.翻转单词顺序](docs/剑指Offer/58-I.翻转单词顺序/58-I.翻转单词顺序.md)\n    * [58-II.左旋转字符串](docs/剑指Offer/58-II.左旋转字符串/58-II.左旋转字符串.md)\n    * [64.求1+2+…+n](docs/剑指Offer/64.求1+2+…+n/64.求1+2+…+n.md)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgoogtech%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgoogtech%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgoogtech%2Fleetcode/lists"}