{"id":47129253,"url":"https://github.com/moeyang/go-leetcode","last_synced_at":"2026-03-12T20:00:01.400Z","repository":{"id":42182853,"uuid":"347872488","full_name":"MoeYang/go-leetcode","owner":"MoeYang","description":"leetcode题解，不定时更新。","archived":false,"fork":false,"pushed_at":"2022-07-05T06:37:52.000Z","size":375,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-03-11T23:56:44.375Z","etag":null,"topics":["algorithm","go","golang","interview-questions","leetcode"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MoeYang.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-03-15T07:16:54.000Z","updated_at":"2021-12-29T03:49:53.000Z","dependencies_parsed_at":"2022-09-01T14:04:26.028Z","dependency_job_id":null,"html_url":"https://github.com/MoeYang/go-leetcode","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"purl":"pkg:github/MoeYang/go-leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MoeYang%2Fgo-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MoeYang%2Fgo-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MoeYang%2Fgo-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MoeYang%2Fgo-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MoeYang","download_url":"https://codeload.github.com/MoeYang/go-leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MoeYang%2Fgo-leetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30441854,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-12T14:34:45.044Z","status":"ssl_error","status_checked_at":"2026-03-12T14:09:33.793Z","response_time":114,"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":["algorithm","go","golang","interview-questions","leetcode"],"created_at":"2026-03-12T19:59:59.635Z","updated_at":"2026-03-12T20:00:01.390Z","avatar_url":"https://github.com/MoeYang.png","language":null,"readme":"# go-leetcode\n\n刷题集合，不定期更新\n\n\n------------\n### array\n- [15.三数之和](https://github.com/MoeYang/go-leetcode/blob/main/array/15.三数之和.md)\n- [31.下一个排列](https://github.com/MoeYang/go-leetcode/blob/main/array/31.下一个排列.md)\n- [39.组合总和](https://github.com/MoeYang/go-leetcode/blob/main/array/39.组合总和.md)\n- [56.合并区间](https://github.com/MoeYang/go-leetcode/blob/main/array/56.合并区间.md)\n- [80.删除有序数组中的重复项II](https://github.com/MoeYang/go-leetcode/blob/main/array/80.删除有序数组中的重复项II.md)\n- [128.最长连续序列](https://github.com/MoeYang/go-leetcode/blob/main/array/128.最长连续序列.md)\n- [453.最小操作次数使数组元素相等](https://github.com/MoeYang/go-leetcode/blob/main/array/453.最小操作次数使数组元素相等.md)\n- [560.和为K的子数组](https://github.com/MoeYang/go-leetcode/blob/main/array/560.和为K的子数组.md)\n- [581.最短无序连续子数组](https://github.com/MoeYang/go-leetcode/blob/main/array/581.最短无序连续子数组.md)\n- [930.和相同的二元子数组](https://github.com/MoeYang/go-leetcode/blob/main/array/930.和相同的二元子数组.md)\n- [1695.删除子数组的最大得分](https://github.com/MoeYang/go-leetcode/blob/main/array/1695.删除子数组的最大得分.md)\n- [1711.大餐计数](https://github.com/MoeYang/go-leetcode/blob/main/array/1711.大餐计数.md)\n- [1726.同积元组](https://github.com/MoeYang/go-leetcode/blob/main/array/1726.同积元组.md)\n- [1738.找出第K大的异或坐标值](https://github.com/MoeYang/go-leetcode/blob/main/array/1738.找出第K大的异或坐标值.md)\n- [1817.查找用户活跃分钟数](https://github.com/MoeYang/go-leetcode/blob/main/array/1817.查找用户活跃分钟数.md)\n- [1823.找出游戏的获胜者](https://github.com/MoeYang/go-leetcode/blob/main/array/1823.找出游戏的获胜者.md)\n- [1906.查询差绝对值的最小值](https://github.com/MoeYang/go-leetcode/blob/main/array/1906.查询差绝对值的最小值.md)\n- [1943.描述绘画结果](https://github.com/MoeYang/go-leetcode/blob/main/array/1943.描述绘画结果.md)\n- [1968.构造元素不等于两相邻元素平均值的数组](https://github.com/MoeYang/go-leetcode/blob/main/array/1968.构造元素不等于两相邻元素平均值的数组.md)\n- [面试题10.09.排序矩阵查找](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题10.09.排序矩阵查找.md)\n- [面试题10.11.峰与谷](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题10.11.峰与谷.md)\n- [面试题16.06.最小差](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.06.最小差.md)\n- [面试题16.10.生存人数](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.10.生存人数.md)\n- [面试题16.11.跳水板](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.11.跳水板.md)\n- [面试题16.16.部分排序](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.16.部分排序.md)\n- [面试题16.17.连续数列](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.17.连续数列.md)\n- [面试题16.21.交换和](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.21.交换和.md)\n- [面试题16.24.数对和](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题16.24.数对和.md)\n- [面试题17.05.字母与数字](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题17.05.字母与数字.md)\n- [面试题17.10.主要元素](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题17.10.主要元素.md)\n- [面试题17.11.单词距离](https://github.com/MoeYang/go-leetcode/blob/main/array/面试题17.11.单词距离.md)\n\n### bfs\n- [127.单词接龙](https://github.com/MoeYang/go-leetcode/blob/main/bfs/127.单词接龙.md)\n- [207.课程表](https://github.com/MoeYang/go-leetcode/blob/main/bfs/207.课程表.md)\n- [542.01矩阵](https://github.com/MoeYang/go-leetcode/blob/main/bfs/542.01矩阵.md)\n- [752.打开转盘锁](https://github.com/MoeYang/go-leetcode/blob/main/bfs/752.打开转盘锁.md)\n- [1345.跳跃游戏IV](https://github.com/MoeYang/go-leetcode/blob/main/bfs/1345.跳跃游戏IV.md)\n- [1765.地图中的最高点](https://github.com/MoeYang/go-leetcode/blob/main/bfs/1765.地图中的最高点.md)\n- [1871.跳跃游戏VII](https://github.com/MoeYang/go-leetcode/blob/main/bfs/1871.跳跃游戏VII.md)\n- [1926.迷宫中离入口最近的出口](https://github.com/MoeYang/go-leetcode/blob/main/bfs/1926.迷宫中离入口最近的出口.md)\n- [1928.规定时间内到达终点的最小花费](https://github.com/MoeYang/go-leetcode/blob/main/bfs/1928.规定时间内到达终点的最小花费.md)\n- [2059.转化数字的最小运算数](https://github.com/MoeYang/go-leetcode/blob/main/bfs/2059.转化数字的最小运算数.md)\n- [面试题04.01.节点间通路](https://github.com/MoeYang/go-leetcode/blob/main/bfs/面试题04.01.节点间通路.md)\n\n### binary\n- [33.搜索旋转排序数组](https://github.com/MoeYang/go-leetcode/blob/main/binary/33.搜索旋转排序数组.md)\n- [153.寻找旋转排序数组中的最小值](https://github.com/MoeYang/go-leetcode/blob/main/binary/153.寻找旋转排序数组中的最小值.md)\n- [475.供暖器](https://github.com/MoeYang/go-leetcode/blob/main/binary/475.供暖器.md)\n- [1011.在D天内送达包裹的能力](https://github.com/MoeYang/go-leetcode/blob/main/binary/1011.在D天内送达包裹的能力.md)\n- [1044.最长重复子串](https://github.com/MoeYang/go-leetcode/blob/main/binary/1044.最长重复子串.md)\n- [1760.袋子里最少数目的球](https://github.com/MoeYang/go-leetcode/blob/main/binary/1760.袋子里最少数目的球.md)\n- [1818.绝对差值和](https://github.com/MoeYang/go-leetcode/blob/main/binary/1818.绝对差值和.md)\n- [1898.可移除字符的最大数目](https://github.com/MoeYang/go-leetcode/blob/main/binary/1898.可移除字符的最大数目.md)\n- [2055.蜡烛之间的盘子](https://github.com/MoeYang/go-leetcode/blob/main/binary/2055.蜡烛之间的盘子.md)\n- [2080.区间内查询数字的频率](https://github.com/MoeYang/go-leetcode/blob/main/binary/2080.区间内查询数字的频率.md)\n- [剑指OfferII072.求平方根](https://github.com/MoeYang/go-leetcode/blob/main/binary/剑指OfferII072.求平方根.md)\n- [剑指OfferII073.狒狒吃香蕉](https://github.com/MoeYang/go-leetcode/blob/main/binary/剑指OfferII073.狒狒吃香蕉.md)\n- [面试题10.03.搜索旋转数组](https://github.com/MoeYang/go-leetcode/blob/main/binary/面试题10.03.搜索旋转数组.md)\n\n### design\n- [355.设计推特](https://github.com/MoeYang/go-leetcode/blob/main/design/355.设计推特.md)\n- [380.O(1)时间插入、删除和获取随机元素](https://github.com/MoeYang/go-leetcode/blob/main/design/380.O(1)时间插入、删除和获取随机元素.md)\n- [1865.找出和为指定值的下标对](https://github.com/MoeYang/go-leetcode/blob/main/design/1865.找出和为指定值的下标对.md)\n- [面试题16.25.LRU缓存](https://github.com/MoeYang/go-leetcode/blob/main/design/面试题16.25.LRU缓存.md)\n\n### dfs\n- [39.组合总和](https://github.com/MoeYang/go-leetcode/blob/main/dfs/39.组合总和.md)\n- [40.组合总和II](https://github.com/MoeYang/go-leetcode/blob/main/dfs/40.组合总和II.md)\n- [46.全排列](https://github.com/MoeYang/go-leetcode/blob/main/dfs/46.全排列.md)\n- [78.子集](https://github.com/MoeYang/go-leetcode/blob/main/dfs/78.子集.md)\n- [79.单词搜索](https://github.com/MoeYang/go-leetcode/blob/main/dfs/79.单词搜索.md)\n- [90.子集II](https://github.com/MoeYang/go-leetcode/blob/main/dfs/90.子集II.md)\n- [301.删除无效的括号](https://github.com/MoeYang/go-leetcode/blob/main/dfs/301.删除无效的括号.md)\n- [375.猜数字大小II](https://github.com/MoeYang/go-leetcode/blob/main/dfs/375.猜数字大小II.md)\n- [552.学生出勤记录II](https://github.com/MoeYang/go-leetcode/blob/main/dfs/552.学生出勤记录II.md)\n- [797.所有可能的路径](https://github.com/MoeYang/go-leetcode/blob/main/dfs/797.所有可能的路径.md)\n- [1718.构建字典序最大的可行序列](https://github.com/MoeYang/go-leetcode/blob/main/dfs/1718.构建字典序最大的可行序列.md)\n- [1723.完成所有工作的最短时间](https://github.com/MoeYang/go-leetcode/blob/main/dfs/1723.完成所有工作的最短时间.md)\n- [1774.最接近目标价格的甜点成本](https://github.com/MoeYang/go-leetcode/blob/main/dfs/1774.最接近目标价格的甜点成本.md)\n- [1963.使字符串平衡的最小交换次数](https://github.com/MoeYang/go-leetcode/blob/main/dfs/1963.使字符串平衡的最小交换次数.md)\n- [1981.最小化目标值与所选元素的差](https://github.com/MoeYang/go-leetcode/blob/main/dfs/1981.最小化目标值与所选元素的差.md)\n- [2002.两个回文子序列长度的最大乘积](https://github.com/MoeYang/go-leetcode/blob/main/dfs/2002.两个回文子序列长度的最大乘积.md)\n- [2049.统计最高分的节点数目](https://github.com/MoeYang/go-leetcode/blob/main/dfs/2049.统计最高分的节点数目.md)\n- [5747.将字符串拆分为递减的连续值](https://github.com/MoeYang/go-leetcode/blob/main/dfs/5747.将字符串拆分为递减的连续值.md)\n- [剑指Offer38.字符串的排列](https://github.com/MoeYang/go-leetcode/blob/main/dfs/剑指Offer38.字符串的排列.md)\n- [面试题08.04.幂集](https://github.com/MoeYang/go-leetcode/blob/main/dfs/面试题08.04.幂集.md)\n- [面试题08.08.有重复字符串的排列组合](https://github.com/MoeYang/go-leetcode/blob/main/dfs/面试题08.08.有重复字符串的排列组合.md)\n- [面试题08.09.括号](https://github.com/MoeYang/go-leetcode/blob/main/dfs/面试题08.09.括号.md)\n- [面试题17.15.最长单词](https://github.com/MoeYang/go-leetcode/blob/main/dfs/面试题17.15.最长单词.md)\n- [面试题17.22.单词转换](https://github.com/MoeYang/go-leetcode/blob/main/dfs/面试题17.22.单词转换.md)\n\n### dp\n- [5.最长回文子串](https://github.com/MoeYang/go-leetcode/blob/main/dp/5.最长回文子串.md)\n- [62.不同路径](https://github.com/MoeYang/go-leetcode/blob/main/dp/62.不同路径.md)\n- [64.最小路径和](https://github.com/MoeYang/go-leetcode/blob/main/dp/64.最小路径和.md)\n- [72.编辑距离](https://github.com/MoeYang/go-leetcode/blob/main/dp/72.编辑距离.md)\n- [91.解码方法](https://github.com/MoeYang/go-leetcode/blob/main/dp/91.解码方法.md)\n- [115.不同的子序列](https://github.com/MoeYang/go-leetcode/blob/main/dp/115.不同的子序列.md)\n- [121.买卖股票的最佳时机](https://github.com/MoeYang/go-leetcode/blob/main/dp/121.买卖股票的最佳时机.md)\n- [132.分割回文串II](https://github.com/MoeYang/go-leetcode/blob/main/dp/132.分割回文串II.md)\n- [139.单词拆分](https://github.com/MoeYang/go-leetcode/blob/main/dp/139.单词拆分.md)\n- [152.乘积最大子数组](https://github.com/MoeYang/go-leetcode/blob/main/dp/152.乘积最大子数组.md)\n- [213.打家劫舍II](https://github.com/MoeYang/go-leetcode/blob/main/dp/213.打家劫舍II.md)\n- [221.最大正方形](https://github.com/MoeYang/go-leetcode/blob/main/dp/221.最大正方形.md)\n- [300.最长递增子序列](https://github.com/MoeYang/go-leetcode/blob/main/dp/300.最长递增子序列.md)\n- [309.最佳买卖股票时机含冷冻期](https://github.com/MoeYang/go-leetcode/blob/main/dp/309.最佳买卖股票时机含冷冻期.md)\n- [322.零钱兑换](https://github.com/MoeYang/go-leetcode/blob/main/dp/322.零钱兑换.md)\n- [337.打家劫舍 III](https://github.com/MoeYang/go-leetcode/blob/main/dp/337.打家劫舍III.md)\n- [354.俄罗斯套娃信封问题](https://github.com/MoeYang/go-leetcode/blob/main/dp/354.俄罗斯套娃信封问题.md)\n- [368.最大整除子集](https://github.com/MoeYang/go-leetcode/blob/main/dp/368.最大整除子集.md)\n- [377.组合总和Ⅳ](https://github.com/MoeYang/go-leetcode/blob/main/dp/377.组合总和Ⅳ.md)\n- [403.青蛙过河](https://github.com/MoeYang/go-leetcode/blob/main/dp/403.青蛙过河.md)\n- [416.分割等和子集](https://github.com/MoeYang/go-leetcode/blob/main/dp/416.分割等和子集.md)\n- [516.最长回文子序列](https://github.com/MoeYang/go-leetcode/blob/main/dp/516.最长回文子序列.md)\n- [518.零钱兑换II](https://github.com/MoeYang/go-leetcode/blob/main/dp/518.零钱兑换II.md)\n- [647.回文子串](https://github.com/MoeYang/go-leetcode/blob/main/dp/647.回文子串.md)\n- [718.最长重复子数组](https://github.com/MoeYang/go-leetcode/blob/main/dp/718.最长重复子数组.md)\n- [873.最长的斐波那契子序列的长度](https://github.com/MoeYang/go-leetcode/blob/main/dp/873.最长的斐波那契子序列的长度.md)\n- [877.石子游戏](https://github.com/MoeYang/go-leetcode/blob/main/dp/877.石子游戏.md)\n- [1035.不相交的线](https://github.com/MoeYang/go-leetcode/blob/main/dp/1035.不相交的线.md)\n- [1269.停在原地的方案数](https://github.com/MoeYang/go-leetcode/blob/main/dp/1269.停在原地的方案数.md)\n- [1690.石子游戏VII](https://github.com/MoeYang/go-leetcode/blob/main/dp/1690.石子游戏VII.md)\n- [1691.堆叠长方体的最大高度](https://github.com/MoeYang/go-leetcode/blob/main/dp/1691.堆叠长方体的最大高度.md)\n- [1696.跳跃游戏VI](https://github.com/MoeYang/go-leetcode/blob/main/dp/1696.跳跃游戏VI.md)\n- [1751.最多可以参加的会议数目II](https://github.com/MoeYang/go-leetcode/blob/main/dp/1751.最多可以参加的会议数目II.md)\n- [1770.执行乘法运算的最大分数](https://github.com/MoeYang/go-leetcode/blob/main/dp/1770.执行乘法运算的最大分数.md)\n- [1771.由子序列构造的最长回文串的长度](https://github.com/MoeYang/go-leetcode/blob/main/dp/1771.由子序列构造的最长回文串的长度.md)\n- [1857.有向图中最大颜色值](https://github.com/MoeYang/go-leetcode/blob/main/dp/1857.有向图中最大颜色值.md)\n- [1866.恰有K根木棍可以看到的排列数目](https://github.com/MoeYang/go-leetcode/blob/main/dp/1866.恰有K根木棍可以看到的排列数目.md)\n- [1872.石子游戏VIII](https://github.com/MoeYang/go-leetcode/blob/main/dp/1872.石子游戏VIII.md)\n- [1911.最大子序列交替和](https://github.com/MoeYang/go-leetcode/blob/main/dp/1911.最大子序列交替和.md)\n- [1937.扣分后的最大得分](https://github.com/MoeYang/go-leetcode/blob/main/dp/1937.扣分后的最大得分.md)\n- [2008.出租车的最大盈利](https://github.com/MoeYang/go-leetcode/blob/main/dp/2008.出租车的最大盈利.md)\n- [面试题08.02.迷路的机器人](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题08.02.迷路的机器人.md)\n- [面试题08.11.硬币](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题08.11.硬币.md)\n- [面试题08.13.堆箱子](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题08.13.堆箱子.md)\n- [面试题08.14.布尔运算](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题08.14.布尔运算.md)\n- [面试题17.08.马戏团人塔](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.08.马戏团人塔.md)\n- [面试题17.09.第k个数](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.09.第k个数.md)\n- [面试题17.13.恢复空格](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.13.恢复空格.md)\n- [面试题17.16.按摩师](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.16.按摩师.md)\n- [面试题17.23.最大黑方阵](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.23.最大黑方阵.md)\n- [面试题17.24.最大子矩阵](https://github.com/MoeYang/go-leetcode/blob/main/dp/面试题17.24.最大子矩阵.md)\n\n### divide-and-conquer\n- [312.戳气球](https://github.com/MoeYang/go-leetcode/blob/main/divide-and-conquer/312.戳气球.md)\n\n### graph\n- [743.网络延迟时间](https://github.com/MoeYang/go-leetcode/blob/main/graph/743.网络延迟时间.md)\n- [787.K站中转内最便宜的航班](https://github.com/MoeYang/go-leetcode/blob/main/graph/787.K站中转内最便宜的航班.md)\n- [802.找到最终的安全状态](https://github.com/MoeYang/go-leetcode/blob/main/graph/802.找到最终的安全状态.md)\n\n### greedy\n- [11.盛最多水的容器](https://github.com/MoeYang/go-leetcode/blob/main/greedy/11.盛最多水的容器.md)\n- [334.递增的三元子序列](https://github.com/MoeYang/go-leetcode/blob/main/greedy/334.递增的三元子序列.md)\n- [406.根据身高重建队列](https://github.com/MoeYang/go-leetcode/blob/main/greedy/406.根据身高重建队列.md)\n- [621.任务调度器](https://github.com/MoeYang/go-leetcode/blob/main/greedy/621.任务调度器.md)\n- [630.课程表III](https://github.com/MoeYang/go-leetcode/blob/main/greedy/630.课程表III.md)\n- [1685.有序数组中差绝对值之和](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1685.有序数组中差绝对值之和.md)\n- [1686.石子游戏VI](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1686.石子游戏VI.md)\n- [1689.十-二进制数的最少数目](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1689.十-二进制数的最少数目.md)\n- [1727.重新排列后的最大子矩阵](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1727.重新排列后的最大子矩阵.md)\n- [1744.你能在你最喜欢的那天吃到你最喜欢的糖果吗？](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1744.你能在你最喜欢的那天吃到你最喜欢的糖果吗？.md)\n- [1749.任意子数组和的绝对值的最大值](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1749.任意子数组和的绝对值的最大值.md)\n- [1754.构造字典序最大的合并字符串](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1754.构造字典序最大的合并字符串.md)\n- [1833.雪糕的最大数量](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1833.雪糕的最大数量.md)\n- [1840.最高建筑高度](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1840.最高建筑高度.md)\n- [1855.下标对中的最大距离](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1855.下标对中的最大距离.md)\n- [1877.数组中最大数对和的最小值](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1877.数组中最大数对和的最小值.md)\n- [1946.子字符串突变后可能得到的最大整数](https://github.com/MoeYang/go-leetcode/blob/main/greedy/1946.子字符串突变后可能得到的最大整数.md)\n- [2017.网格游戏](https://github.com/MoeYang/go-leetcode/blob/main/greedy/2017.网格游戏.md)\n- [2029.石子游戏IX](https://github.com/MoeYang/go-leetcode/blob/main/greedy/2029.石子游戏IX.md)\n- [2086.从房屋收集雨水需要的最少水桶数](https://github.com/MoeYang/go-leetcode/blob/main/greedy/2086.从房屋收集雨水需要的最少水桶数.md)\n- [2116.判断一个括号字符串是否有效](https://github.com/MoeYang/go-leetcode/blob/main/greedy/2116.判断一个括号字符串是否有效.md)\n- [5760.构成交替字符串需要的最小交换次数](https://github.com/MoeYang/go-leetcode/blob/main/greedy/5760.构成交替字符串需要的最小交换次数.md)\n\n### hash\n- [187.重复的DNA序列](https://github.com/MoeYang/go-leetcode/blob/main/hash/187.重复的DNA序列.md)\n- [554.砖墙](https://github.com/MoeYang/go-leetcode/blob/main/hash/554.砖墙.md)\n- [1218.最长定差子序列](https://github.com/MoeYang/go-leetcode/blob/main/hash/1218.最长定差子序列.md)\n- [1743.从相邻元素对还原数组](https://github.com/MoeYang/go-leetcode/blob/main/hash/1743.从相邻元素对还原数组.md)\n- [1930.长度为3的不同回文子序列](https://github.com/MoeYang/go-leetcode/blob/main/hash/1930.长度为3的不同回文子序列.md)\n- [面试题17.26.稀疏相似度](https://github.com/MoeYang/go-leetcode/blob/main/hash/面试题17.26.稀疏相似度.md)\n\n### heap\n- [218.天际线问题](https://github.com/MoeYang/go-leetcode/blob/main/heap/218.天际线问题.md)\n- [313.超级丑数](https://github.com/MoeYang/go-leetcode/blob/main/heap/313.超级丑数.md)\n- [373.查找和最小的K对数字](https://github.com/MoeYang/go-leetcode/blob/main/heap/373.查找和最小的K对数字.md)\n- [502.IPO](https://github.com/MoeYang/go-leetcode/blob/main/heap/502.IPO.md)\n- [1753.移除石子的最大得分](https://github.com/MoeYang/go-leetcode/blob/main/heap/1753.移除石子的最大得分.md)\n- [1801.积压订单中的订单总数](https://github.com/MoeYang/go-leetcode/blob/main/heap/1801.积压订单中的订单总数.md)\n- [1834.单线程CPU](https://github.com/MoeYang/go-leetcode/blob/main/heap/1834.单线程CPU.md)\n- [1882.使用服务器处理任务](https://github.com/MoeYang/go-leetcode/blob/main/heap/1882.使用服务器处理任务.md)\n- [1942.最小未被占据椅子的编号](https://github.com/MoeYang/go-leetcode/blob/main/heap/1942.最小未被占据椅子的编号.md)\n- [2034.股票价格波动](https://github.com/MoeYang/go-leetcode/blob/main/heap/2034.股票价格波动.md)\n- [2064.分配给商店的最多商品的最小值](https://github.com/MoeYang/go-leetcode/blob/main/heap/2064.分配给商店的最多商品的最小值.md)\n- [5748.包含每个查询的最小区间](https://github.com/MoeYang/go-leetcode/blob/main/heap/5748.包含每个查询的最小区间.md)\n- [LCP30.魔塔游戏](https://github.com/MoeYang/go-leetcode/blob/main/heap/LCP30.魔塔游戏.md)\n- [面试题17.20.连续中值](https://github.com/MoeYang/go-leetcode/blob/main/heap/面试题17.20.连续中值.md)\n\n### list\n- [2.两数相加](https://github.com/MoeYang/go-leetcode/blob/main/list/2.两数相加.md)\n- [19.删除链表的倒数第N个结点](https://github.com/MoeYang/go-leetcode/blob/main/list/19.删除链表的倒数第N个结点.md)\n- [23.合并K个升序链表](https://github.com/MoeYang/go-leetcode/blob/main/list/23.合并K个升序链表.md)\n- [148.排序链表](https://github.com/MoeYang/go-leetcode/blob/main/list/148.排序链表.md)\n- [430.扁平化多级双向链表](https://github.com/MoeYang/go-leetcode/blob/main/list/430.扁平化多级双向链表.md)\n- [面试题02.06.回文链表](https://github.com/MoeYang/go-leetcode/blob/main/list/面试题02.06.回文链表.md)\n- [面试题02.07.链表相交](https://github.com/MoeYang/go-leetcode/blob/main/list/面试题02.07.链表相交.md)\n- [面试题02.08.环路检测](https://github.com/MoeYang/go-leetcode/blob/main/list/面试题02.08.环路检测.md)\n\n### math\n- [96.不同的二叉搜索树](https://github.com/MoeYang/go-leetcode/blob/main/math/96.不同的二叉搜索树.md)\n- [137.只出现一次的数字II](https://github.com/MoeYang/go-leetcode/blob/main/math/137.只出现一次的数字II.md)\n- [149.直线上最多的点数](https://github.com/MoeYang/go-leetcode/blob/main/math/149.直线上最多的点数.md)\n- [523.连续的子数组和](https://github.com/MoeYang/go-leetcode/blob/main/math/523.连续的子数组和.md)\n- [1780.判断一个数字是否可以表示成三的幂的和](https://github.com/MoeYang/go-leetcode/blob/main/math/1780.判断一个数字是否可以表示成三的幂的和.md)\n- [1785.构成特定和需要添加的最少元素](https://github.com/MoeYang/go-leetcode/blob/main/math/1785.构成特定和需要添加的最少元素.md)\n- [1862.向下取整数对和](https://github.com/MoeYang/go-leetcode/blob/main/math/1862.向下取整数对和.md)\n- [面试题16.05.阶乘尾数](https://github.com/MoeYang/go-leetcode/blob/main/math/面试题16.05.阶乘尾数.md)\n- [面试题16.14.最佳直线](https://github.com/MoeYang/go-leetcode/blob/main/math/面试题16.14.最佳直线.md)\n- [面试题17.01.不用加号的加法](https://github.com/MoeYang/go-leetcode/blob/main/math/面试题17.01.不用加号的加法.md)\n- [面试题17.04.消失的数字](https://github.com/MoeYang/go-leetcode/blob/main/math/面试题17.04.消失的数字.md)\n\n\n### slide_window\n- [3.无重复字符的最长子串](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/3.无重复字符的最长子串.md)\n- [76.最小覆盖子串](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/76.最小覆盖子串.md)\n- [438.找到字符串中所有字母异位词](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/438.找到字符串中所有字母异位词.md)\n- [713.乘积小于K的子数组](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/713.乘积小于K的子数组.md)\n- [面试题17.18.最短超串](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/面试题17.18.最短超串.md)\n- [1838.最高频元素的频数](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/1838.最高频元素的频数.md)\n- [2134.最少交换次数来组合所有的1II](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/2134.最少交换次数来组合所有的1II.md)\n- [5873.考试的最大困扰度](https://github.com/MoeYang/go-leetcode/blob/main/slide_window/5873.考试的最大困扰度.md)\n\n### sorts\n- [1996.游戏中弱角色的数量](https://github.com/MoeYang/go-leetcode/blob/main/sorts/1996.游戏中弱角色的数量.md)\n- [2050.并行课程III](https://github.com/MoeYang/go-leetcode/blob/main/sorts/2050.并行课程III.md)\n- [2054.两个最好的不重叠活动](https://github.com/MoeYang/go-leetcode/blob/main/sorts/2054.两个最好的不重叠活动.md)\n- [剑指OfferII115.重建序列](https://github.com/MoeYang/go-leetcode/blob/main/sorts/剑指OfferII115.重建序列.md)\n\n### stack\n- [32.最长有效括号](https://github.com/MoeYang/go-leetcode/blob/main/stack/32.最长有效括号.md)\n- [42.接雨水](https://github.com/MoeYang/go-leetcode/blob/main/stack/42.接雨水.md)\n- [84.柱状图中最大的矩形](https://github.com/MoeYang/go-leetcode/blob/main/stack/84.柱状图中最大的矩形.md)\n- [85.最大矩形](https://github.com/MoeYang/go-leetcode/blob/main/stack/85.最大矩形.md)\n- [239.滑动窗口最大值](https://github.com/MoeYang/go-leetcode/blob/main/stack/239.滑动窗口最大值.md)\n- [456.132模式](https://github.com/MoeYang/go-leetcode/blob/main/stack/456.132模式.md)\n- [496.下一个更大元素I](https://github.com/MoeYang/go-leetcode/blob/main/stack/496.下一个更大元素I.md)\n- [739.每日温度](https://github.com/MoeYang/go-leetcode/blob/main/stack/739.每日温度.md)\n- [907.子数组的最小值之和](https://github.com/MoeYang/go-leetcode/blob/main/stack/907.子数组的最小值之和.md)\n- [1717.删除子字符串的最大得分](https://github.com/MoeYang/go-leetcode/blob/main/stack/1717.删除子字符串的最大得分.md)\n- [1793.好子数组的最大分数](https://github.com/MoeYang/go-leetcode/blob/main/stack/1793.好子数组的最大分数.md)\n- [1856.子数组最小乘积的最大值](https://github.com/MoeYang/go-leetcode/blob/main/stack/1856.子数组最小乘积的最大值.md)\n- [1944.队列中可以看到的人数](https://github.com/MoeYang/go-leetcode/blob/main/stack/1944.队列中可以看到的人数.md)\n- [面试题16.26.计算器](https://github.com/MoeYang/go-leetcode/blob/main/stack/面试题16.26.计算器.md)\n- [面试题17.21.直方图的水量](https://github.com/MoeYang/go-leetcode/blob/main/stack/面试题17.21.直方图的水量.md)\n\n### string\n- [28.实现strStr()](https://github.com/MoeYang/go-leetcode/blob/main/string/28.实现strStr().md)\n- [844.比较含退格的字符串](https://github.com/MoeYang/go-leetcode/blob/main/string/844.比较含退格的字符串.md)\n- [926.将字符串翻转到单调递增](https://github.com/MoeYang/go-leetcode/blob/main/string/926.将字符串翻转到单调递增.md)\n- [1759.统计同构子字符串的数目](https://github.com/MoeYang/go-leetcode/blob/main/string/1759.统计同构子字符串的数目.md)\n- [1790.仅执行一次字符串交换能否使两个字符串相等](https://github.com/MoeYang/go-leetcode/blob/main/string/1790.仅执行一次字符串交换能否使两个字符串相等.md)\n- [1805.字符串中不同整数的数目](https://github.com/MoeYang/go-leetcode/blob/main/string/1805.字符串中不同整数的数目.md)\n- [1807.替换字符串中的括号内容](https://github.com/MoeYang/go-leetcode/blob/main/string/1807.替换字符串中的括号内容.md)\n- [1813.句子相似性III](https://github.com/MoeYang/go-leetcode/blob/main/string/1813.句子相似性III.md)\n- [1839.所有元音按顺序排布的最长子字符串](https://github.com/MoeYang/go-leetcode/blob/main/string/1839.所有元音按顺序排布的最长子字符串.md)\n- [1915.最美子字符串的数目](https://github.com/MoeYang/go-leetcode/blob/main/string/1915.最美子字符串的数目.md)\n\n### tree\n- [96.不同的二叉搜索树](https://github.com/MoeYang/go-leetcode/blob/main/tree/96.不同的二叉搜索树.md)\n- [98.验证二叉搜索树](https://github.com/MoeYang/go-leetcode/blob/main/tree/98.验证二叉搜索树.md)\n- [99.恢复二叉搜索树](https://github.com/MoeYang/go-leetcode/blob/main/tree/99.恢复二叉搜索树.md)\n- [101.对称二叉树](https://github.com/MoeYang/go-leetcode/blob/main/tree/101.对称二叉树.md)\n- [102.二叉树的层序遍历](https://github.com/MoeYang/go-leetcode/blob/main/tree/102.二叉树的层序遍历.md)\n- [105.从前序与中序遍历序列构造二叉树](https://github.com/MoeYang/go-leetcode/blob/main/tree/105.从前序与中序遍历序列构造二叉树.md)\n- [114.二叉树展开为链表](https://github.com/MoeYang/go-leetcode/blob/main/tree/114.二叉树展开为链表.md)\n- [124.二叉树中的最大路径和](https://github.com/MoeYang/go-leetcode/blob/main/tree/124.二叉树中的最大路径和.md)\n- [208.实现Trie(前缀树)](https://github.com/MoeYang/go-leetcode/blob/main/tree/208.实现Trie(前缀树).md)\n- [297.二叉树的序列化与反序列化](https://github.com/MoeYang/go-leetcode/blob/main/tree/297.二叉树的序列化与反序列化.md)\n- [437. 路径总和 III](https://github.com/MoeYang/go-leetcode/blob/main/tree/437.路径总和III.md)\n- [538.把二叉搜索树转换为累加树](https://github.com/MoeYang/go-leetcode/blob/main/tree/538.把二叉搜索树转换为累加树.md)\n- [729.我的日程安排表I](https://github.com/MoeYang/go-leetcode/blob/main/tree/729.我的日程安排表I.md)\n- [783.二叉搜索树节点最小距离](https://github.com/MoeYang/go-leetcode/blob/main/tree/783.二叉搜索树节点最小距离.md)\n- [863.二叉树中所有距离为K的结点](https://github.com/MoeYang/go-leetcode/blob/main/tree/863.二叉树中所有距离为K的结点.md)\n- [919.完全二叉树插入器](https://github.com/MoeYang/go-leetcode/blob/main/tree/919.完全二叉树插入器.md)\n- [993.二叉树的堂兄弟节点](https://github.com/MoeYang/go-leetcode/blob/main/tree/993.二叉树的堂兄弟节点.md)\n- [剑指OfferII067.最大的异或](https://github.com/MoeYang/go-leetcode/blob/main/tree/剑指OfferII067.最大的异或.md)\n- [面试题04.05.合法二叉搜索树](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题04.05.合法二叉搜索树.md)\n- [面试题04.06.后继者](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题04.06.后继者.md)\n- [面试题04.08.首个共同祖先](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题04.08.首个共同祖先.md)\n- [面试题04.12.求和路径](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题04.12.求和路径.md)\n- [面试题10.10.数字流的秩](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题10.10.数字流的秩.md)\n- [面试题17.12.BiNode](https://github.com/MoeYang/go-leetcode/blob/main/tree/面试题17.12.BiNode.md)\n\n### trie\n- [面试题17.17.多次搜索](https://github.com/MoeYang/go-leetcode/blob/main/trie/面试题17.17.多次搜索.md)\n- [面试题17.25.单词矩阵](https://github.com/MoeYang/go-leetcode/blob/main/trie/面试题17.25.单词矩阵.md)\n\n### union_find\n- [1697.检查边长度限制的路径是否存在](https://github.com/MoeYang/go-leetcode/blob/main/union_find/1697.检查边长度限制的路径是否存在.md)\n- [1722.执行交换操作后的最小汉明距离](https://github.com/MoeYang/go-leetcode/blob/main/union_find/1722.执行交换操作后的最小汉明距离.md)\n- [1905.统计子岛屿](https://github.com/MoeYang/go-leetcode/blob/main/union_find/1905.统计子岛屿.md)\n- [2076.处理含限制条件的好友请求](https://github.com/MoeYang/go-leetcode/blob/main/union_find/2076.处理含限制条件的好友请求.md)\n- [LCS03.主题空间](https://github.com/MoeYang/go-leetcode/blob/main/union_find/LCS03.主题空间.md)\n- [面试题16.19.水域大小](https://github.com/MoeYang/go-leetcode/blob/main/union_find/面试题16.19.水域大小.md)\n- [面试题17.07.婴儿名字](https://github.com/MoeYang/go-leetcode/blob/main/union_find/面试题17.07.婴儿名字.md)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmoeyang%2Fgo-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmoeyang%2Fgo-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmoeyang%2Fgo-leetcode/lists"}