{"id":23924782,"url":"https://github.com/yankewei/leetcode","last_synced_at":"2025-04-12T02:33:13.123Z","repository":{"id":52272741,"uuid":"118847116","full_name":"yankewei/LeetCode","owner":"yankewei","description":"LeetCode 问题的解决方法","archived":false,"fork":false,"pushed_at":"2025-03-22T09:16:23.000Z","size":331,"stargazers_count":6,"open_issues_count":166,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-12T02:32:14.501Z","etag":null,"topics":["algorithm","go","leetcode","leetcode-solutions","php"],"latest_commit_sha":null,"homepage":"","language":"Go","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/yankewei.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2018-01-25T01:50:33.000Z","updated_at":"2025-03-22T09:16:27.000Z","dependencies_parsed_at":"2025-03-22T10:21:17.868Z","dependency_job_id":"3cd31f72-e2d6-41a2-957b-9c67587243be","html_url":"https://github.com/yankewei/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yankewei%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yankewei%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yankewei%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yankewei%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yankewei","download_url":"https://codeload.github.com/yankewei/LeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248506932,"owners_count":21115510,"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":["algorithm","go","leetcode","leetcode-solutions","php"],"created_at":"2025-01-05T19:18:38.066Z","updated_at":"2025-04-12T02:33:13.117Z","avatar_url":"https://github.com/yankewei.png","language":"Go","readme":"# LeetCode\n\nLeetCode问题的解决方法\n### Algorithm\n\n#### 困难程度\n[![简单](https://img.shields.io/badge/%E7%AE%80%E5%8D%95-5cb85c)](https://github.com/yankewei/LeetCode-Go/labels/%E7%AE%80%E5%8D%95)\n[![中等](https://img.shields.io/badge/%E4%B8%AD%E7%AD%89-f0ad4e)](https://github.com/yankewei/LeetCode-Go/labels/%E4%B8%AD%E7%AD%89)\n[![困难](https://img.shields.io/badge/%E5%9B%B0%E9%9A%BE-d9534f)](https://github.com/yankewei/LeetCode-Go/labels/%E5%9B%B0%E9%9A%BE)\n#### 类型\n[![字符串](https://img.shields.io/badge/%E5%AD%97%E7%AC%A6%E4%B8%B2-c2e0c6)](https://github.com/yankewei/LeetCode-Go/labels/%E5%AD%97%E7%AC%A6%E4%B8%B2)\n[![数组](https://img.shields.io/badge/%E6%95%B0%E7%BB%84-efa5ac)](https://github.com/yankewei/LeetCode-Go/labels/%E6%95%B0%E7%BB%84)\n[![链表](https://img.shields.io/badge/%E9%93%BE%E8%A1%A8-e2f497)](https://github.com/yankewei/LeetCode-Go/labels/%E9%93%BE%E8%A1%A8)\n[![设计](https://img.shields.io/badge/%E8%AE%BE%E8%AE%A1-4e32bc)](https://github.com/yankewei/LeetCode-Go/labels/%E8%AE%BE%E8%AE%A1)\n[![数学](https://img.shields.io/badge/%E6%95%B0%E5%AD%A6-d4c5f9)](https://github.com/yankewei/LeetCode-Go/labels/%E6%95%B0%E5%AD%A6)\n[![树](https://img.shields.io/badge/%E6%A0%91-c2e0c6)](https://github.com/yankewei/LeetCode-Go/labels/%E6%A0%91)\n#### 解法\n[![位运算](https://img.shields.io/badge/%E4%BD%8D%E8%BF%90%E7%AE%97-7786d1)](https://github.com/yankewei/LeetCode-Go/labels/%E4%BD%8D%E8%BF%90%E7%AE%97)\n[![双指针](https://img.shields.io/badge/%E5%8F%8C%E6%8C%87%E9%92%88-388099)](https://github.com/yankewei/LeetCode-Go/labels/%E5%8F%8C%E6%8C%87%E9%92%88)\n[![栈](https://img.shields.io/badge/%E6%A0%88-d015ed)](https://github.com/yankewei/LeetCode-Go/labels/%E6%A0%88)\n[![滑动窗口](https://img.shields.io/badge/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3-f4d577)](https://github.com/yankewei/LeetCode-Go/labels/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3)\n[![广度优先搜索](https://img.shields.io/badge/%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A0-61e8a4)](https://github.com/yankewei/LeetCode-Go/labels/%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2)\n[![动态规划](https://img.shields.io/badge/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92-e2770b)](https://github.com/yankewei/LeetCode-Go/labels/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92)\n[![二分查找](https://img.shields.io/badge/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE-3b8fba)](https://github.com/yankewei/LeetCode-Go/labels/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE)\n[![深度优先搜索](https://img.shields.io/badge/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2-9f59e0)](https://github.com/yankewei/LeetCode-Go/labels/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2)\n[![哈希表](https://img.shields.io/badge/%E5%93%88%E5%B8%8C%E8%A1%A8-46a9bf)](https://github.com/yankewei/LeetCode-Go/labels/%E5%93%88%E5%B8%8C%E8%A1%A8)\n[![排序](https://img.shields.io/badge/%E6%8E%92%E5%BA%8F-3ce522)](https://github.com/yankewei/LeetCode-Go/labels/%E6%8E%92%E5%BA%8F)\n[![贪心算法](https://img.shields.io/badge/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95-ed7bce)](https://github.com/yankewei/LeetCode-Go/labels/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95)\n[![回溯算法](https://img.shields.io/badge/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95-e5408d)](https://github.com/yankewei/LeetCode-Go/labels/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95)\n[![并查集](https://img.shields.io/badge/%E5%B9%B6%E6%9F%A5%E9%9B%86-AA3CBC)](https://github.com/yankewei/LeetCode-Go/labels/%E5%B9%B6%E6%9F%A5%E9%9B%86)\n[![前缀和](https://img.shields.io/badge/%E5%89%8D%E7%BC%80%E5%92%8C-584500)](https://github.com/yankewei/LeetCode-Go/labels/%E5%89%8D%E7%BC%80%E5%92%8C)\n[![字典树](https://img.shields.io/badge/%E5%AD%97%E5%85%B8%E6%A0%91-D63A7F)](https://github.com/yankewei/LeetCode-Go/labels/%E5%AD%97%E5%85%B8%E6%A0%91)\n[![递归](https://img.shields.io/badge/%E9%80%92%E5%BD%92-4B4B8C)](https://github.com/yankewei/LeetCode-Go/labels/%E9%80%92%E5%BD%92)\n#### 题目\n- [两数之和]()\n- [两数相加](https://github.com/yankewei/LeetCode-Go/issues/71)\n- [无重复字符的最长子串](https://github.com/yankewei/LeetCode-Go/issues/6)\n- [电话号码的字母组合](https://github.com/yankewei/LeetCode-Go/issues/59)\n- [有效的括号](https://github.com/yankewei/LeetCode-Go/issues/4)\n- [串联所有单词的子串](https://github.com/yankewei/LeetCode-Go/issues/30)\n- [在排序数组中查找元素的第一个和最后一个位置](https://github.com/yankewei/LeetCode-Go/issues/37)\n- [搜索插入位置](https://github.com/yankewei/LeetCode-Go/issues/45)\n- [缺失的第一个正数](https://github.com/yankewei/LeetCode-Go/issues/32)\n- [字母异位词分组](https://github.com/yankewei/LeetCode-Go/issues/80)\n- [最大子序和](./Algorithm/最大子序和.md)\n- [最小路径和](https://github.com/yankewei/LeetCode-Go/issues/46)\n- [爬楼梯](https://github.com/yankewei/LeetCode-Go/issues/16)\n- [简化路径](https://github.com/yankewei/LeetCode-Go/issues/7)\n- [分隔链表](https://github.com/yankewei/LeetCode-Go/issues/3) |\n- [合并两个有序数组](https://github.com/yankewei/LeetCode-Go/issues/9)\n- [不同的二叉搜索树](https://github.com/yankewei/LeetCode-Go/issues/44)\n- [二叉树的层序遍历](https://github.com/yankewei/LeetCode-Go/issues/53)\n- [二叉树的锯齿形层序遍历](https://github.com/yankewei/LeetCode-Go/issues/87)\n- [二叉树的最大深度](https://github.com/yankewei/LeetCode-Go/issues/50)\n- [二叉树的最小深度](https://github.com/yankewei/LeetCode-Go/issues/52)\n- [路径总和](https://github.com/yankewei/LeetCode-Go/issues/41)\n- [填充每个节点的下一个右侧节点指针](https://github.com/yankewei/LeetCode-Go/issues/63)\n- [路径总和](https://github.com/yankewei/LeetCode-Go/issues/41)\n- [杨辉三角](./Algorithm/杨辉三角.md) \n- [买卖股票的最佳时机](https://github.com/yankewei/LeetCode-Go/issues/15)\n- [买卖股票的最佳时机Ⅱ](./Algorithm/买卖股票的最佳时机Ⅱ.md)\n- [单词接龙](https://github.com/yankewei/LeetCode-Go/issues/36)\n- [复制带随机指针的链表](https://github.com/yankewei/LeetCode-Go/issues/73)\n- [相交链表](https://github.com/yankewei/LeetCode-Go/issues/77)\n- [两数之和 II - 输入有序数组](https://github.com/yankewei/LeetCode-Go/issues/43)\n- [多数元素](https://github.com/yankewei/LeetCode-Go/issues/19)\n- [打家劫舍](https://github.com/yankewei/LeetCode-Go/issues/33)\n- [快乐数](https://github.com/yankewei/LeetCode-Go/issues/79)\n- [长度最小的子数组](https://github.com/yankewei/LeetCode-Go/issues/38)\n- [存在重复元素](./Algorithm/存在重复元素.md)\n- [存在重复元素Ⅱ](./Algorithm/存在重复元素Ⅱ.md)\n- [用队列实现栈](https://github.com/yankewei/LeetCode-Go/issues/5)\n- [翻转二叉树](./Algorithm/Invert-Binary-Tree.md)\n- [回文链表](https://github.com/yankewei/LeetCode-Go/issues/68)\n- [搜索二维矩阵Ⅱ](https://github.com/yankewei/LeetCode-Go/issues/27)\n- [单词规律](https://github.com/yankewei/LeetCode-Go/issues/82)\n- [最长上升子序列](https://github.com/yankewei/LeetCode-Go/issues/20)\n- [零钱兑换](https://github.com/yankewei/LeetCode-Go/issues/14)\n- [整数拆分](https://github.com/yankewei/LeetCode-Go/issues/51)\n- [反转字符串中的元音字母](https://github.com/yankewei/LeetCode-Go/issues/60)\n- [两个数组的交集 II](https://github.com/yankewei/LeetCode-Go/issues/42)\n- [水壶问题](https://github.com/yankewei/LeetCode-Go/issues/28)\n- [字符串中的第一个唯一字符](https://github.com/yankewei/LeetCode-Go/issues/88)\n- [找不同](https://github.com/yankewei/LeetCode-Go/issues/84)\n- [判断子序列](https://github.com/yankewei/LeetCode-Go/issues/49)\n- [最长回文串](https://github.com/yankewei/LeetCode-Go/issues/26)\n- [分割数组的最大值](https://github.com/yankewei/LeetCode-Go/issues/48)\n- [两数相加 II](https://github.com/yankewei/LeetCode-Go/issues/76)\n- [扁平化多级双向链表](https://github.com/yankewei/LeetCode-Go/issues/72)\n- [分发饼干](https://github.com/yankewei/LeetCode-Go/issues/89)\n- [重复的子字符串](https://github.com/yankewei/LeetCode-Go/issues/40)\n- [岛屿的周长](https://github.com/yankewei/LeetCode-Go/issues/21)\n- [下一个更大元素 I](https://github.com/yankewei/LeetCode-Go/issues/8)\n- [二叉搜索树的最小绝对差](https://github.com/yankewei/LeetCode-Go/issues/61)\n- [反转字符串中的单词 III](https://github.com/yankewei/LeetCode-Go/issues/55)\n- [合并二叉树](https://github.com/yankewei/LeetCode-Go/issues/70)\n- [岛屿的最大面积](https://github.com/yankewei/LeetCode-Go/issues/22)\n- [买卖股票的最佳时机含手续费](https://github.com/yankewei/LeetCode-Go/issues/83)\n- [单调递增的数字](https://github.com/yankewei/LeetCode-Go/issues/81)\n- [矩形重叠](https://github.com/yankewei/LeetCode-Go/issues/25)\n- [链表的中间结点](https://github.com/yankewei/LeetCode-Go/issues/29)\n- [比较含退格的字符串](https://github.com/yankewei/LeetCode-Go/issues/66)\n- [两句话中的不常见单词](https://github.com/yankewei/LeetCode-Go/issues/78)\n- [长按键入](https://github.com/yankewei/LeetCode-Go/issues/67)\n- [有效的山脉数组](https://github.com/yankewei/LeetCode-Go/issues/69)\n- [使数组唯一的最小增量](https://github.com/yankewei/LeetCode-Go/issues/31)\n- [有序数组的平方](https://github.com/yankewei/LeetCode-Go/issues/64)\n- [数组形式的整数加法](https://github.com/yankewei/LeetCode-Go/issues/95)\n- [腐烂的橘子](https://github.com/yankewei/LeetCode-Go/issues/10)\n- [查找常用字符](https://github.com/yankewei/LeetCode-Go/issues/62)\n- [总持续时间可被 60 整除的歌曲](https://github.com/yankewei/LeetCode-Go/issues/34)\n- [将数组分成和相等的三个部分](https://github.com/yankewei/LeetCode-Go/issues/17)\n- [最后一块石头的重量](https://github.com/yankewei/LeetCode-Go/issues/90)\n- [字符串的最大公因子](https://github.com/yankewei/LeetCode-Go/issues/18)\n- [分糖果 II](https://github.com/yankewei/LeetCode-Go/issues/11)\n- [拼写单词](https://github.com/yankewei/LeetCode-Go/issues/24)\n- [二进制链表转整数](https://github.com/yankewei/LeetCode-Go/issues/1)\n- [拥有最多糖果的孩子](https://github.com/yankewei/LeetCode-Go/issues/35)\n- [一维数组的动态和](https://github.com/yankewei/LeetCode-Go/issues/47)\n- [千位分隔数](https://github.com/yankewei/LeetCode-Go/issues/97)\n- [你可以获得的最大硬币数目](https://github.com/yankewei/LeetCode-Go/issues/56)\n- [返回倒数第 k 个节点](https://github.com/yankewei/LeetCode-Go/issues/2)\n- [最长连续递增序列](https://github.com/yankewei/LeetCode-Go/issues/98)\n- [省份数量](https://github.com/yankewei/LeetCode-Go/issues/99)\n- [等价多米诺骨牌对的数量](https://github.com/yankewei/LeetCode-Go/issues/100)\n- [寻找数组的中心索引](https://github.com/yankewei/LeetCode-Go/issues/101)\n- [和为K的子数组](https://github.com/yankewei/LeetCode-Go/issues/102)\n- [公平的糖果棒交换](https://github.com/yankewei/LeetCode-Go/issues/105)\n- [替换后的最长重复字符](https://github.com/yankewei/LeetCode-Go/issues/106)\n- [子数组最大平均数 I](https://github.com/yankewei/LeetCode-Go/issues/107)\n- [尽可能使字符串相等](https://github.com/yankewei/LeetCode-Go/issues/108)\n- [最大连续1的个数](https://github.com/yankewei/LeetCode-Go/issues/109)\n- [数组拆分 I](https://github.com/yankewei/LeetCode-Go/issues/110)\n- [重塑矩阵](https://github.com/yankewei/LeetCode-Go/issues/111)\n- [最大连续1的个数 III](https://github.com/yankewei/LeetCode-Go/issues/112)\n- [翻转图像](https://github.com/yankewei/LeetCode-Go/issues/116)\n- [转置矩阵](https://github.com/yankewei/LeetCode-Go/issues/117)\n- [括号生成](https://github.com/yankewei/LeetCode-Go/issues/118)\n- [单调数列](https://github.com/yankewei/LeetCode-Go/issues/119)\n- [区域和检索 - 数组不可变](https://github.com/yankewei/LeetCode-Go/issues/120)\n- [比特位计数](https://github.com/yankewei/LeetCode-Go/issues/121)\n- [俄罗斯套娃信封问题](https://github.com/yankewei/LeetCode-Go/issues/122)\n- [删除字符串中的所有相邻重复项](https://github.com/yankewei/LeetCode-Go/issues/123)\n- [基本计算器 II](https://github.com/yankewei/LeetCode-Go/issues/124)\n- [子集](https://github.com/yankewei/LeetCode-Go/issues/129)\n- [笨阶乘](https://github.com/yankewei/LeetCode-Go/issues/130)\n- [最大数](https://github.com/yankewei/LeetCode-Go/issues/131)\n- [二叉搜索树节点最小距离](https://github.com/yankewei/LeetCode-Go/issues/132)\n- [实现 Trie (前缀树)](https://github.com/yankewei/LeetCode-Go/issues/133)\n- [打家劫舍 II](https://github.com/yankewei/LeetCode-Go/issues/134)\n- [递增顺序搜索树](https://github.com/yankewei/LeetCode-Go/issues/135)\n- [错误的集合](https://github.com/yankewei/LeetCode-Go/issues/136)\n- [点菜展示表](https://github.com/yankewei/LeetCode-Go/issues/137)\n- [基于时间的键值存储](https://github.com/yankewei/LeetCode-Go/issues/138)\n- [逐步求和得到正数的最小值](https://github.com/yankewei/LeetCode-Go/issues/140)\n- [找出数组的最大公约数](https://github.com/yankewei/LeetCode-Go/issues/141)\n- [寻找峰值](https://github.com/yankewei/LeetCode-Go/issues/142)\n- [截断句子](https://github.com/yankewei/LeetCode-Go/issues/143)\n- [差的绝对值为 K 的数对数目](https://github.com/yankewei/LeetCode-Go/issues/144)\n- [单值二叉树](https://github.com/yankewei/LeetCode-Go/issues/145)\n- [生成每种字符都是奇数个的字符串](https://github.com/yankewei/LeetCode/issues/147)\n- [有序队列](https://github.com/yankewei/LeetCode/issues/148)\n- [非递增顺序的最小子序列](https://github.com/yankewei/LeetCode/issues/149)\n- [数组中的字符串匹配](https://github.com/yankewei/LeetCode/issues/150)\n- [在二叉树中增加一行](https://github.com/yankewei/LeetCode/issues/151)\n- [函数的独占时间](https://github.com/yankewei/LeetCode/issues/152)\n- [层数最深叶子节点的和](https://github.com/yankewei/LeetCode/issues/153)\n- [检查单词是否为句中其他单词的前缀](https://github.com/yankewei/LeetCode/issues/154)\n- [重新排列单词间的空格](https://github.com/yankewei/LeetCode/issues/157)\n- [文件夹操作日志搜集器](https://github.com/yankewei/LeetCode/issues/158)\n- [按照频率将数组升序排序](https://github.com/yankewei/LeetCode/issues/159)\n- [最长的字母序连续子字符串的长度](https://github.com/yankewei/LeetCode/issues/161)\n- [移动片段得到字符串](https://github.com/yankewei/LeetCode/issues/162)\n- [到最近的人的最大距离](https://github.com/yankewei/LeetCode/issues/163)\n- [统计参与通信的服务器](https://github.com/yankewei/LeetCode/issues/164)\n- [统计二叉树中好节点的数目](https://github.com/yankewei/LeetCode/issues/165)\n- [汇总区间](https://github.com/yankewei/LeetCode/issues/166)\n- [一最多的行](https://github.com/yankewei/LeetCode/issues/167)\n#### 周赛题\n- [重复至少 K 次且长度为 M 的模式 (204周赛题)](https://github.com/yankewei/LeetCode-Go/issues/54)\n- [替换所有的问号(205周赛题)](https://github.com/yankewei/LeetCode-Go/issues/57)\n- [交换链表中的节点](https://github.com/yankewei/LeetCode-Go/issues/92)\n- [同积元组【第224场周赛】](https://github.com/yankewei/LeetCode-Go/issues/94)\n- [避免重复字母的最小删除成本(205周赛题)](https://github.com/yankewei/LeetCode-Go/issues/58)\n- [两个相同字符之间的最长子字符串](https://github.com/yankewei/LeetCode-Go/issues/65)\n- [检查两个字符串数组是否相等【216场周赛题】](https://github.com/yankewei/LeetCode-Go/issues/74)\n- [具有给定数值的最小字符串【216场周赛题】](https://github.com/yankewei/LeetCode-Go/issues/75)\n- [重新格式化电话号码 【第220场周赛】](https://github.com/yankewei/LeetCode-Go/issues/85)\n- [删除子数组的最大得分 【第220场周赛】](https://github.com/yankewei/LeetCode-Go/issues/86)\n- [可以形成最大正方形的矩形数目【224场周赛】](https://github.com/yankewei/LeetCode-Go/issues/93)\n- [替换隐藏数字得到的最晚时间【第225场周赛】](https://github.com/yankewei/LeetCode-Go/issues/96)\n- [盒子中小球的最大数量](https://github.com/yankewei/LeetCode-Go/issues/103)\n- [从相邻元素对还原数组](https://github.com/yankewei/LeetCode-Go/issues/104)\n- [交替合并字符串](https://github.com/yankewei/LeetCode-Go/issues/114)\n- [移动所有球到每个盒子所需的最小操作数](https://github.com/yankewei/LeetCode-Go/issues/115)\n- [字符串中第二大的数字](https://github.com/yankewei/LeetCode-Go/issues/125)\n- [字符串中不同整数的数目](https://github.com/yankewei/LeetCode-Go/issues/126)\n- [还原排列的最少操作步数](https://github.com/yankewei/LeetCode-Go/issues/127)\n- [替换字符串中的括号内容](https://github.com/yankewei/LeetCode-Go/issues/128)\n- [检查字符串是否为数组前缀](https://github.com/yankewei/LeetCode-Go/issues/139)\n- [使数组中所有元素都等于零](https://github.com/yankewei/LeetCode/issues/146)\n- [和有限的最长子序列](https://github.com/yankewei/LeetCode/issues/155)\n- [从字符串中移除星号](https://github.com/yankewei/LeetCode/issues/156)\n#### 面试题\n- [和为s的连续正数序列](https://github.com/yankewei/LeetCode-Go/issues/12)\n- [队列的最大值](https://github.com/yankewei/LeetCode-Go/issues/13)\n- [字符串压缩](https://github.com/yankewei/LeetCode-Go/issues/23)\n- [用两个栈实现队列](https://github.com/yankewei/LeetCode-Go/issues/39)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyankewei%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyankewei%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyankewei%2Fleetcode/lists"}