https://github.com/godcong/leetcode
This is an leetcode problem-solving project, completed with go
https://github.com/godcong/leetcode
Last synced: about 2 months ago
JSON representation
This is an leetcode problem-solving project, completed with go
- Host: GitHub
- URL: https://github.com/godcong/leetcode
- Owner: godcong
- License: mit
- Created: 2018-03-13T02:03:05.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2025-02-01T17:18:40.000Z (4 months ago)
- Last Synced: 2025-03-27T18:49:52.491Z (2 months ago)
- Language: Go
- Homepage:
- Size: 4.16 MB
- Stars: 1
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# leetcode
## Implementation ##
Name rule #Index#.#Function#.go
Index represents the number in leecode
## Test case ##
Name rule #Index#.#Function#_test.go
## Common definitions ##
All append into def.go
## About ##
This project has compiled and collected relatively efficient problem-solving algorithms
### PS ###
Code after 2022/02/20 may not be completed
## All completed questions ##
### 总完成:417 ###
| 目录 | 标题 | 题目名称 | 函数入口 | 测试代码 |
|:--------:|:--------------------------------------------------------|:--------------------------------------------------------|:--------:|:--------:|
| 0001 | 两数之和 | two-sum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0001\0001.two-sum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0001\0001.two-sum.go_test.go) |
| 0001 | 两数之和 | twoSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0001.twoSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0001.twoSum.go_test.go) |
| 0002 | 两数相加 | addTwoNumbersAdd | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0002\0002.addTwoNumbersAdd.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0002\0002.addTwoNumbersAdd.go_test.go) |
| 0003 | 无重复字符的最长子串 | lengthOfLongestSubstring | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0003.lengthOfLongestSubstring.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0003.lengthOfLongestSubstring.go_test.go) |
| 0005 | 最长回文子串 | longestPalindrome | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0005.longestPalindrome.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0005.longestPalindrome.go_test.go) |
| 0006 | Z 字形变换 | convert | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0006.convert.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0006.convert.go_test.go) |
| 0007 | 整数反转 | reverse | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0007\0007.reverse.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0007\0007.reverse.go_test.go) |
| 0007 | 整数反转 | reverse | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0007.reverse.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0007.reverse.go_test.go) |
| 0008 | 字符串转换整数 (atoi) | myAtoi | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0008.myAtoi.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0008.myAtoi.go_test.go) |
| 0012 | 整数转罗马数字 | intToRoman | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0012\0012.intToRoman.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0012\0012.intToRoman.go_test.go) |
| 0013 | 罗马数字转整数 | romanToInt | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0013\0013.romanToInt.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0013\0013.romanToInt.go_test.go) |
| 0014 | 最长公共前缀 | longestCommonPrefix | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0014.longestCommonPrefix.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0014.longestCommonPrefix.go_test.go) |
| 0017 | 电话号码的字母组合 | letterCombinations | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0017.letterCombinations.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0017.letterCombinations.go_test.go) |
| 0018 | 四数之和 | fourSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0018.fourSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0018.fourSum.go_test.go) |
| 0019 | 删除链表的倒数第N个节点 | removeNthFromEnd | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0019.removeNthFromEnd.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0019.removeNthFromEnd.go_test.go) |
| 0020 | 有效的括号 | isValid | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0020.isValid.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0020.isValid.go_test.go) |
| 0024 | 两两交换链表中的节点 | swapPairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0024.swapPairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0024.swapPairs.go_test.go) |
| 0026 | 删除有序数组中的重复项 | removeDuplicates | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0026\0026.removeDuplicates.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0026\0026.removeDuplicates.go_test.go) |
| 0027 | 移除元素 | removeElement | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0027\0027.removeElement.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0027\0027.removeElement.go_test.go) |
| 0027 | 移除元素 | removeElement | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0027.removeElement.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0027.removeElement.go_test.go) |
| | 实现 strStr() | 0028 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0028\0028.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0028\0028.go_test.go) |
| 0031 | 下一个排列 | nextPermutation | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0031.nextPermutation.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0031.nextPermutation.go_test.go) |
| 0034 | 在排序数组中查找元素的第一个和最后一个位置 | searchRange | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0034.searchRange.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0034.searchRange.go_test.go) |
| 0037 | 解数独 | solveSudoku | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0037.solveSudoku.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0037.solveSudoku.go_test.go) |
| 0039 | 组合总和 | combinationSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0039.combinationSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0039.combinationSum.go_test.go) |
| 0040 | 组合总和 II | combinationSum2 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0040.combinationSum2.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0040.combinationSum2.go_test.go) |
| 0043 | 字符串相乘 | multiply | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0043.multiply.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0043.multiply.go_test.go) |
| 0047 | 全排列 II | permuteUnique | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0047.permuteUnique.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0047.permuteUnique.go_test.go) |
| 0048 | 旋转图像 | rotate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0048.rotate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0048.rotate.go_test.go) |
| 0049 | 字母异位词分组 | groupAnagrams | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0049.groupAnagrams.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0049.groupAnagrams.go_test.go) |
| | N 皇后 | 0051 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0051\0051.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0051\0051.go_test.go) |
| 0051 | N 皇后 | solveNQueens | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0051.solveNQueens.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0051.solveNQueens.go_test.go) |
| 0052 | N皇后 II | totalNQueens | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0052.totalNQueens.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0052.totalNQueens.go_test.go) |
| 0054 | 螺旋矩阵 | spiralOrder | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0054\0054.spiralOrder.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0054\0054.spiralOrder.go_test.go) |
| 0057 | 插入区间 | insert | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0057.insert.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0057.insert.go_test.go) |
| 0058 | 最后一个单词的长度 | lengthOfLastWord | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0058.lengthOfLastWord.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0058.lengthOfLastWord.go_test.go) |
| | 螺旋矩阵 II | 0059 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0059\0059.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0059\0059.go_test.go) |
| 0060 | 第k个排列 | getPermutation | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0060.getPermutation.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0060.getPermutation.go_test.go) |
| 0061 | 旋转链表 | rotateRight | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0061\0061.rotateRight.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0061\0061.rotateRight.go_test.go) |
| 0062 | 不同路径 | uniquePaths | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0062.uniquePaths.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0062.uniquePaths.go_test.go) |
| 0065 | 有效数字 | isNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0065\0065.isNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0065\0065.isNumber.go_test.go) |
| 0067 | 二进制求和 | addBinary | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0067.addBinary.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0067.addBinary.go_test.go) |
| 0070 | 爬楼梯 | climbStairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0070.climbStairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0070.climbStairs.go_test.go) |
| 0073 | 矩阵置零 | setZeroes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0073\0073.setZeroes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0073\0073.setZeroes.go_test.go) |
| 0074 | 搜索二维矩阵 | searchMatrix | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0074\0074.searchMatrix.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0074\0074.searchMatrix.go_test.go) |
| 0075 | 颜色分类 | sortColors | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0075.sortColors.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0075.sortColors.go_test.go) |
| 0077 | 组合 | combine | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0077.combine.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0077.combine.go_test.go) |
| 0078 | 子集 | subsets | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0078.subsets.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0078.subsets.go_test.go) |
| 0079 | 单词搜索 | exist | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0079.exist.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0079.exist.go_test.go) |
| 0080 | 删除有序数组中的重复项 II | removeDuplicates | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0080\0080.removeDuplicates.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0080\0080.removeDuplicates.go_test.go) |
| 0081 | 搜索旋转排序数组 II | search | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0081\0081.search.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0081\0081.search.go_test.go) |
| 0082 | 删除排序链表中的重复元素 II | deleteDuplicates | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0082\0082.deleteDuplicates.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0082\0082.deleteDuplicates.go_test.go) |
| 0083 | 删除排序链表中的重复元素 | deleteDuplicates | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0083\0083.deleteDuplicates.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0083\0083.deleteDuplicates.go_test.go) |
| 0085 | 最大矩形 | maximalRectangle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0085.maximalRectangle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0085.maximalRectangle.go_test.go) |
| 0086 | 分隔链表 | partition | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0086.partition.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0086.partition.go_test.go) |
| 0087 | 扰乱字符串 | isScramble | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0087\0087.isScramble.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0087\0087.isScramble.go_test.go) |
| 0088 | 合并两个有序数组 | merge | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0088\0088.merge.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0088\0088.merge.go_test.go) |
| 0090 | 子集 II | subsetsWithDup | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0090\0090.subsetsWithDup.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0090\0090.subsetsWithDup.go_test.go) |
| 0091 | 解码方法 | numDecodings | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0091\0091.numDecodings.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0091\0091.numDecodings.go_test.go) |
| 0092 | 反转链表 II | reverseBetween | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0092\0092.reverseBetween.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0092\0092.reverseBetween.go_test.go) |
| 0093 | 复原IP地址 | restoreIpAddresses | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0093.restoreIpAddresses.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0093.restoreIpAddresses.go_test.go) |
| 0094 | 二叉树的中序遍历 | inorderTraversal | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0094.inorderTraversal.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0094.inorderTraversal.go_test.go) |
| 0099 | 恢复二叉搜索树 | recoverTree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0099.recoverTree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0099.recoverTree.go_test.go) |
| 0100 | 平衡二叉树 | isBalanced | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0100.isBalanced.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0100.isBalanced.go_test.go) |
| 0100 | 相同的树 | isSameTree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0100.isSameTree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0100.isSameTree.go_test.go) |
| 0103 | 二叉树的锯齿形层序遍历 | zigzagLevelOrder | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0103.zigzagLevelOrder.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0103.zigzagLevelOrder.go_test.go) |
| 0106 | 从中序与后序遍历序列构造二叉树 | buildTree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0106.buildTree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0106.buildTree.go_test.go) |
| 0107 | 二叉树的层次遍历 II | levelOrderBottom | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0107.levelOrderBottom.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0107.levelOrderBottom.go_test.go) |
| 0109 | 有序链表转换二叉搜索树 | sortedListToBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0109.sortedListToBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0109.sortedListToBST.go_test.go) |
| 0111 | 二叉树的最小深度 | minDepth | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0111.minDepth.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0111.minDepth.go_test.go) |
| 0113 | 路径总和 II | pathSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0113.pathSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0113.pathSum.go_test.go) |
| 0114 | 填充每个节点的下一个右侧节点指针 | connect | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0114.connect.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0114.connect.go_test.go) |
| 0115 | 不同的子序列 | numDistinct | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0115\0115.numDistinct.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0115\0115.numDistinct.go_test.go) |
| 0117 | 填充每个节点的下一个右侧节点指针 II | connect | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0117.connect.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0117.connect.go_test.go) |
| 0118 | 杨辉三角 | generate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0118.generate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0118.generate.go_test.go) |
| 0119 | 杨辉三角 II | getRow | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0119.getRow.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0119.getRow.go_test.go) |
| 0122 | 买卖股票的最佳时机 II | maxProfit | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0122.maxProfit.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0122.maxProfit.go_test.go) |
| 0123 | 买卖股票的最佳时机 III | maxProfit | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0123.maxProfit.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0123.maxProfit.go_test.go) |
| 0127 | 单词接龙 | ladderLength | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0127.ladderLength.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0127.ladderLength.go_test.go) |
| 0129 | 求根到叶子节点数字之和 | sumNumbersDFS | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0129.sumNumbersDFS.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0129.sumNumbersDFS.go_test.go) |
| 0130 | 被围绕的区域 | solve | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0130.solve.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0130.solve.go_test.go) |
| | 分割回文串 | 0131 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0131\0131.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0131\0131.go_test.go) |
| 0132 | 分割回文串 II | minCut | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0132.minCut.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0132.minCut.go_test.go) |
| 0133 | 克隆图 | cloneGraph | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0133.cloneGraph.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0133.cloneGraph.go_test.go) |
| 0134 | 加油站 | canCompleteCircuit | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0134.canCompleteCircuit.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0134.canCompleteCircuit.go_test.go) |
| 0135 | 分发糖果 | candy | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0135.candy.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0135.candy.go_test.go) |
| 0137 | 只出现一次的数字 II | singleNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0137\0137.singleNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0137\0137.singleNumber.go_test.go) |
| 0137 | 上升下降字符串 | sortString | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0137.sortString.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0137.sortString.go_test.go) |
| 0138 | 复制带随机指针的链表 | copy-list-with-random-pointer | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0138\0138.copy-list-with-random-pointer.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0138\0138.copy-list-with-random-pointer.go_test.go) |
| 0140 | 单词拆分 II | wordBreak | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0140.wordBreak.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0140.wordBreak.go_test.go) |
| 0141 | 环形链表 | hasCycle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0141.hasCycle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0141.hasCycle.go_test.go) |
| 0142 | 环形链表 II | detectCycle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0142.detectCycle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0142.detectCycle.go_test.go) |
| 0143 | 重排链表 | reorderList | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0143.reorderList.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0143.reorderList.go_test.go) |
| 0144 | 二叉树的前序遍历 | preorderTraversal | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0144.preorderTraversal.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0144.preorderTraversal.go_test.go) |
| 0145 | 二叉树的后序遍历 | postorderTraversal | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0145.postorderTraversal.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0145.postorderTraversal.go_test.go) |
| 0147 | 对链表进行插入排序 | insertionSortList | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0147.insertionSortList.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0147.insertionSortList.go_test.go) |
| 0148 | 排序链表 | sortList | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0148.sortList.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0148.sortList.go_test.go) |
| 0149 | 直线上最多的点数 | max-points-on-a-line | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0149\0149.max-points-on-a-line.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0149\0149.max-points-on-a-line.go_test.go) |
| 0150 | 逆波兰表达式求值 | evalRPN | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0150\0150.evalRPN.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0150\0150.evalRPN.go_test.go) |
| 0153 | 寻找旋转排序数组中的最小值 | findMin | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0153\0153.findMin.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0153\0153.findMin.go_test.go) |
| 0154 | 寻找旋转排序数组中的最小值 II | findMin | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0154\0154.findMin.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0154\0154.findMin.go_test.go) |
| 0160 | | getIntersectionNode | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0160\0160.getIntersectionNode.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0160\0160.getIntersectionNode.go_test.go) |
| 0164 | 最大间距 | maximumGap | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0164.maximumGap.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0164.maximumGap.go_test.go) |
| 0168 | Excel表列名称 | excel-sheet-column-title | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0168\0168.excel-sheet-column-title.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0168\0168.excel-sheet-column-title.go_test.go) |
| 0171 | Excel 表列序号 | excel-sheet-column-number | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0171\0171.excel-sheet-column-number.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0171\0171.excel-sheet-column-number.go_test.go) |
| 0173 | 二叉搜索树迭代器 | BSTIterator | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0173\0173.BSTIterator.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0173\0173.BSTIterator.go_test.go) |
| 0179 | 最大数 | largestNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0179\0179.largestNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0179\0179.largestNumber.go_test.go) |
| 0188 | 买卖股票的最佳时机 IV | maxProfit | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0188.maxProfit.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0188.maxProfit.go_test.go) |
| 0189 | 旋转数组 | rotate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0189.rotate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0189.rotate.go_test.go) |
| 0190 | 颠倒二进制位 | reverseBits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0190\0190.reverseBits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0190\0190.reverseBits.go_test.go) |
| 0191 | 位1的个数 | hammingWeight | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0191\0191.hammingWeight.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0191\0191.hammingWeight.go_test.go) |
| 0193 | 有效电话号码 | Bash | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0193.Bash.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0193.Bash.go_test.go) |
| 0201 | 数字范围按位与 | rangeBitwiseAnd | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0201.rangeBitwiseAnd.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0201.rangeBitwiseAnd.go_test.go) |
| 0203 | 移除链表元素 | removeElements | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0203.removeElements.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0203.removeElements.go_test.go) |
| 0204 | 计数质数 | countPrimes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0204.countPrimes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0204.countPrimes.go_test.go) |
| 0205 | 同构字符串 | isIsomorphic | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0205.isIsomorphic.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0205.isIsomorphic.go_test.go) |
| 0208 | 实现 Trie (前缀树) | Trie | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0208\0208.Trie.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0208\0208.Trie.go_test.go) |
| 0213 | 打家劫舍 II | rob | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0213\0213.rob.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0213\0213.rob.go_test.go) |
| 0214 | 最短回文串 | shortestPalindrome | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0214.shortestPalindrome.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0214.shortestPalindrome.go_test.go) |
| 0216 | 组合总和 III | combinationSum3 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0216.combinationSum3.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0216.combinationSum3.go_test.go) |
| 0217 | 存在重复元素 | containsDuplicate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0217.containsDuplicate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0217.containsDuplicate.go_test.go) |
| 0218 | 天际线问题 | the-skyline-problem | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0218\0218.the-skyline-problem.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0218\0218.the-skyline-problem.go_test.go) |
| | 存在重复元素 III | 0220 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0220\0220.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0220\0220.go_test.go) |
| 0222 | 完全二叉树的节点个数 | countNodes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0222.countNodes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0222.countNodes.go_test.go) |
| 0224 | 基本计算器 | calculate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0224.calculate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0224.calculate.go_test.go) |
| 0226 | 翻转二叉树 | invertTree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0226.invertTree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0226.invertTree.go_test.go) |
| 0227 | 基本计算器 II | calculate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0227\0227.calculate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0227\0227.calculate.go_test.go) |
| 0228 | 汇总区间 | summaryRanges | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0228.summaryRanges.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0228.summaryRanges.go_test.go) |
| 0231 | 2 的幂 | isPowerOfTwo | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0231\0231.isPowerOfTwo.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0231\0231.isPowerOfTwo.go_test.go) |
| 0232 | 用栈实现队列 | MyQueue | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0232\0232.MyQueue.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0232\0232.MyQueue.go_test.go) |
| 0233 | 数字 1 的个数 | number-of-digit-one | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0233\0233.number-of-digit-one.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0233\0233.number-of-digit-one.go_test.go) |
| 0234 | 回文链表 | isPalindrome | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0234.isPalindrome.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0234.isPalindrome.go_test.go) |
| 0235 | 二叉搜索树的最近公共祖先 | lowestCommonAncestor | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0235.lowestCommonAncestor.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0235.lowestCommonAncestor.go_test.go) |
| 0239 | 滑动窗口最大值 | maxSlidingWindow | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0239.maxSlidingWindow.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0239.maxSlidingWindow.go_test.go) |
| 0242 | 有效的字母异位词 | isAnagram | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0242.isAnagram.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0242.isAnagram.go_test.go) |
| 0257 | 二叉树的所有路径 | binaryTreePaths | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0257.binaryTreePaths.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0257.binaryTreePaths.go_test.go) |
| 0263 | 丑数 | isUgly | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0263\0263.isUgly.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0263\0263.isUgly.go_test.go) |
| 0264 | 丑数 II | nthUglyNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0264\0264.nthUglyNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0264\0264.nthUglyNumber.go_test.go) |
| 0274 | H 指数 | h-index | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0274\0274.h-index.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0274\0274.h-index.go_test.go) |
| 0275 | H 指数 II | h-index-ii | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0275\0275.h-index-ii.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0275\0275.h-index-ii.go_test.go) |
| 0278 | 第一个错误的版本 | firstBadVersion | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0278\0278.firstBadVersion.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0278\0278.firstBadVersion.go_test.go) |
| | 第一个错误的版本 | dummy | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0278\dummy.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0278\dummy.go_test.go) |
| 0279 | 完全平方数 | numSquares | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0279\0279.numSquares.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0279\0279.numSquares.go_test.go) |
| 0283 | 移动零 | moveZeroes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0283.moveZeroes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0283.moveZeroes.go_test.go) |
| 0290 | 单词规律 | wordPattern | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0290.wordPattern.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0290.wordPattern.go_test.go) |
| 0303 | 区域和检索 - 数组不可变 | SumRange | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0303\0303.SumRange.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0303\0303.SumRange.go_test.go) |
| 0304 | 二维区域和检索 - 矩阵不可变 | SumRegion | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0304\0304.SumRegion.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0304\0304.SumRegion.go_test.go) |
| 0313 | 超级丑数 | super-ugly-number | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0313\0313.super-ugly-number.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0313\0313.super-ugly-number.go_test.go) |
| 0316 | 去除重复字母 | removeDuplicateLetters | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0316.removeDuplicateLetters.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0316.removeDuplicateLetters.go_test.go) |
| 0321 | 拼接最大数 | maxNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0321.maxNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0321.maxNumber.go_test.go) |
| 0327 | 区间和的个数 | countRangeSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0327.countRangeSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0327.countRangeSum.go_test.go) |
| 0328 | 奇偶链表 | oddEvenList | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0328.oddEvenList.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0328.oddEvenList.go_test.go) |
| 0330 | 按要求补齐数组 | minPatches | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0330.minPatches.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0330.minPatches.go_test.go) |
| 0331 | 验证二叉树的前序序列化 | isValidSerialization | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0331.isValidSerialization.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0331.isValidSerialization.go_test.go) |
| 0332 | 重新安排行程 | findItinerary | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0332.findItinerary.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0332.findItinerary.go_test.go) |
| 0338 | 比特位计数 | countBits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0338.countBits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0338.countBits.go_test.go) |
| 0341 | 扁平化嵌套列表迭代器 | NestedIterator | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0341\0341.NestedIterator.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0341\0341.NestedIterator.go_test.go) |
| 0342 | 给定一个整数，写一个函数来判断它是否是 4 的幂次方。如果是，返回 true ；否则，返回 false 。 | isPowerOfFour | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0342\0342.isPowerOfFour.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0342\0342.isPowerOfFour.go_test.go) |
| 0344 | 反转字符串 | reverseString | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0344.reverseString.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0344.reverseString.go_test.go) |
| 0345 | | reverse-vowels-of-a-string | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0345\0345.reverse-vowels-of-a-string.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0345\0345.reverse-vowels-of-a-string.go_test.go) |
| 0347 | 前 K 个高频元素 | topKFrequent | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0347.topKFrequent.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0347.topKFrequent.go_test.go) |
| 0349 | 两个数组的交集 | intersection | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0349.intersection.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0349.intersection.go_test.go) |
| 0354 | 俄罗斯套娃信封问题 | maxEnvelopes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0354.maxEnvelopes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0354.maxEnvelopes.go_test.go) |
| 0363 | 矩形区域不超过 K 的最大数值和 | maxSumSubmatrix | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0363\0363.maxSumSubmatrix.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0363\0363.maxSumSubmatrix.go_test.go) |
| | 最大整除子集 | 0368 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0368\0368.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0368\0368.go_test.go) |
| 0374 | 猜数字大小 | guessNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0374\0374.guessNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0374\0374.guessNumber.go_test.go) |
| | 猜数字大小 | dummy | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0374\dummy.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0374\dummy.go_test.go) |
| 0376 | 摆动序列 | wiggleMaxLength | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0376.wiggleMaxLength.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0376.wiggleMaxLength.go_test.go) |
| 0377 | 组合总和 Ⅳ | combinationSum4 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0377\0377.combinationSum4.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0377\0377.combinationSum4.go_test.go) |
| 0381 | O(1) 时间插入、删除和获取随机元素 - 允许重复 | RandomizedCollection | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0381.RandomizedCollection.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0381.RandomizedCollection.go_test.go) |
| 0387 | 字符串中的第一个唯一字符 | firstUniqChar | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0387.firstUniqChar.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0387.firstUniqChar.go_test.go) |
| 0389 | 找不同 | findTheDifference | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0389.findTheDifference.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0389.findTheDifference.go_test.go) |
| 0395 | 至少有 K 个重复字符的最长子串 | longestSubstring | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0395.longestSubstring.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0395.longestSubstring.go_test.go) |
| 0399 | 除法求值 | calcEquation | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0399.calcEquation.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0399.calcEquation.go_test.go) |
| 0401 | 二进制手表 | binary-watch | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0401\0401.binary-watch.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0401\0401.binary-watch.go_test.go) |
| 0402 | 移掉K位数字 | removeKdigits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0402.removeKdigits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0402.removeKdigits.go_test.go) |
| 0403 | 青蛙过河 | canCross | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0403\0403.canCross.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0403\0403.canCross.go_test.go) |
| 0404 | 左叶子之和 | sumOfLeftLeaves | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0404.sumOfLeftLeaves.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0404.sumOfLeftLeaves.go_test.go) |
| 0406 | 根据身高重建队列 | reconstructQueue | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0406.reconstructQueue.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0406.reconstructQueue.go_test.go) |
| 0413 | 等差数列划分 | arithmetic-slices | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0413\0413.arithmetic-slices.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0413\0413.arithmetic-slices.go_test.go) |
| 0415 | 字符串相加 | addStrings | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0415.addStrings.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0415.addStrings.go_test.go) |
| 0416 | 分割等和子集 | canPartition | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0416.canPartition.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0416.canPartition.go_test.go) |
| 0421 | 数组中两个数的最大异或值 | findMaximumXOR | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0421\0421.findMaximumXOR.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0421\0421.findMaximumXOR.go_test.go) |
| 0424 | 替换后的最长重复字符 | characterReplacement | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0424.characterReplacement.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0424.characterReplacement.go_test.go) |
| 0435 | 无重叠区间 | eraseOverlapIntervals | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0435.eraseOverlapIntervals.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0435.eraseOverlapIntervals.go_test.go) |
| 0446 | 等差数列划分 II - 子序列 | arithmetic-slices-ii-subsequence | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0446\0446.arithmetic-slices-ii-subsequence.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0446\0446.arithmetic-slices-ii-subsequence.go_test.go) |
| 0448 | 找到所有数组中消失的数字 | findDisappearedNumbers | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0448.findDisappearedNumbers.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0448.findDisappearedNumbers.go_test.go) |
| 0451 | 根据字符出现频率排序 | sort-characters-by-frequency | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0451\0451.sort-characters-by-frequency.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0451\0451.sort-characters-by-frequency.go_test.go) |
| 0452 | 用最少数量的箭引爆气球 | findMinArrowShots | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0452.findMinArrowShots.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0452.findMinArrowShots.go_test.go) |
| 0454 | 四数相加 II | fourSumCount | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0454.fourSumCount.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0454.fourSumCount.go_test.go) |
| 0455 | 分发饼干 | findContentChildren | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0455.findContentChildren.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0455.findContentChildren.go_test.go) |
| 0457 | 环形数组是否存在循环 | circular-array-loop | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0457\0457.circular-array-loop.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0457\0457.circular-array-loop.go_test.go) |
| 0459 | 132 模式 | find132pattern | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0459\0459.find132pattern.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0459\0459.find132pattern.go_test.go) |
| 0459 | 重复的子字符串 | repeatedSubstringPattern | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0459.repeatedSubstringPattern.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0459.repeatedSubstringPattern.go_test.go) |
| 0461 | 汉明距离 | hammingDistance | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0461\0461.hammingDistance.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0461\0461.hammingDistance.go_test.go) |
| 0461 | 汉明距离 | hammingDistance | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0461.hammingDistance.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0461.hammingDistance.go_test.go) |
| 0463 | 岛屿的周长 | islandPerimeter | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0463.islandPerimeter.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0463.islandPerimeter.go_test.go) |
| 0474 | 一和零 | findMaxForm | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0474.findMaxForm.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0474.findMaxForm.go_test.go) |
| 0475 | 供暖器 | findRadius | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0475.findRadius.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0475.findRadius.go_test.go) |
| 0480 | 滑动窗口中位数 | medianSlidingWindow | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0480.medianSlidingWindow.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0480.medianSlidingWindow.go_test.go) |
| 0483 | 最小好进制 | smallestGoodBase | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0483\0483.smallestGoodBase.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0483\0483.smallestGoodBase.go_test.go) |
| 0485 | 最大连续1的个数 | findMaxConsecutiveOnes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0485.findMaxConsecutiveOnes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0485.findMaxConsecutiveOnes.go_test.go) |
| 0486 | 预测赢家 | PredictTheWinner | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0486.PredictTheWinner.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0486.PredictTheWinner.go_test.go) |
| 0491 | 递增子序列 | findSubsequences | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0491.findSubsequences.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0491.findSubsequences.go_test.go) |
| 0493 | 翻转对 | reversePairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0493.reversePairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0493.reversePairs.go_test.go) |
| 0494 | 目标和 | findTargetSumWays | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0494\0494.findTargetSumWays.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0494\0494.findTargetSumWays.go_test.go) |
| 0501 | 二叉搜索树中的众数 | findMode | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0501.findMode.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0501.findMode.go_test.go) |
| 0503 | 下一个更大元素 II | nextGreaterElements | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0503.nextGreaterElements.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0503.nextGreaterElements.go_test.go) |
| 0509 | 斐波那契数 | fib | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0509.fib.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0509.fib.go_test.go) |
| 0514 | 自由之路 | findRotateSteps | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0514.findRotateSteps.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0514.findRotateSteps.go_test.go) |
| 0516 | 最长回文子序列 | longest-palindromic-subsequence | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0516\0516.longest-palindromic-subsequence.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0516\0516.longest-palindromic-subsequence.go_test.go) |
| 0518 | 零钱兑换 II | change | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0518\0518.change.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0518\0518.change.go_test.go) |
| 0523 | 连续的子数组和 | checkSubarraySum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0523\0523.checkSubarraySum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0523\0523.checkSubarraySum.go_test.go) |
| 0525 | 连续数组 | contiguous-array | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0525\0525.contiguous-array.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0525\0525.contiguous-array.go_test.go) |
| 0526 | 优美的排列 | beautiful-arrangement | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0526\0526.beautiful-arrangement.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0526\0526.beautiful-arrangement.go_test.go) |
| 0528 | 把二叉搜索树转换为累加树 | convertBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0528.convertBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0528.convertBST.go_test.go) |
| 0530 | 二叉搜索树的最小绝对差 | getMinimumDifference | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0530.getMinimumDifference.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0530.getMinimumDifference.go_test.go) |
| 0532 | 数组中的K-diff数对 | findPairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0532.findPairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0532.findPairs.go_test.go) |
| 0541 | 反转字符串 II | reverse-string-ii | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0541\0541.reverse-string-ii.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0541\0541.reverse-string-ii.go_test.go) |
| 0546 | 移除盒子 | removeBoxes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0546.removeBoxes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0546.removeBoxes.go_test.go) |
| 0547 | 省份数量 | findCircleNum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0547.findCircleNum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0547.findCircleNum.go_test.go) |
| 0551 | 学生出勤记录 I | student-attendance-record-i | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0551\0551.student-attendance-record-i.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0551\0551.student-attendance-record-i.go_test.go) |
| 0552 | | student-attendance-record-ii | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0552\0552.student-attendance-record-ii.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0552\0552.student-attendance-record-ii.go_test.go) |
| 0554 | 砖墙 | leastBricks | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0554\0554.leastBricks.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0554\0554.leastBricks.go_test.go) |
| 0557 | 反转字符串中的单词 III | reverseWords | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0557.reverseWords.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0557.reverseWords.go_test.go) |
| 0561 | 数组拆分 I | arrayPairSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0561.arrayPairSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0561.arrayPairSum.go_test.go) |
| 0566 | 重塑矩阵 | matrixReshape | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0566.matrixReshape.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0566.matrixReshape.go_test.go) |
| 0567 | 字符串的排列 | checkInclusion | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0567.checkInclusion.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0567.checkInclusion.go_test.go) |
| 0576 | 出界的路径数 | out-of-boundary-paths | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0576\0576.out-of-boundary-paths.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0576\0576.out-of-boundary-paths.go_test.go) |
| 0581 | 最短无序连续子数组 | shortest-unsorted-continuous-subarray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0581\0581.shortest-unsorted-continuous-subarray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0581\0581.shortest-unsorted-continuous-subarray.go_test.go) |
| 0581 | 最短无序连续子数组 | findUnsortedSubarray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0581.findUnsortedSubarray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0581.findUnsortedSubarray.go_test.go) |
| 0605 | 种花问题 | canPlaceFlowers | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0605.canPlaceFlowers.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0605.canPlaceFlowers.go_test.go) |
| 0611 | 有效三角形的个数 | valid-triangle-number | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0611\0611.valid-triangle-number.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0611\0611.valid-triangle-number.go_test.go) |
| 0617 | 合并二叉树 | mergeTrees | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0617.mergeTrees.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0617.mergeTrees.go_test.go) |
| 0621 | 任务调度器 | leastInterval | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0621.leastInterval.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0621.leastInterval.go_test.go) |
| 0628 | 三个数的最大乘积 | maximumProduct | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0628.maximumProduct.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0628.maximumProduct.go_test.go) |
| 0633 | 平方数之和 | judgeSquareSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0633\0633.judgeSquareSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0633\0633.judgeSquareSum.go_test.go) |
| 0633 | 平方数之和 | judgeSquareSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0633.judgeSquareSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0633.judgeSquareSum.go_test.go) |
| 0637 | 二叉树的层平均值 | averageOfLevels | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0637.averageOfLevels.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0637.averageOfLevels.go_test.go) |
| 0643 | 子数组最大平均数 I | findMaxAverage | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0643.findMaxAverage.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0643.findMaxAverage.go_test.go) |
| 0645 | 错误的集合 | set-mismatch | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0645\0645.set-mismatch.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0645\0645.set-mismatch.go_test.go) |
| 0647 | 回文子串 | countSubstrings | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0647.countSubstrings.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0647.countSubstrings.go_test.go) |
| 0649 | Dota2 参议院 | predictPartyVictory | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0649.predictPartyVictory.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0649.predictPartyVictory.go_test.go) |
| 0657 | 机器人能否返回原点 | judgeCircle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0657.judgeCircle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0657.judgeCircle.go_test.go) |
| 0659 | 分割数组为连续子序列 | isPossible | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0659.isPossible.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0659.isPossible.go_test.go) |
| 0664 | 奇怪的打印机 | strangePrinter | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0664\0664.strangePrinter.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0664\0664.strangePrinter.go_test.go) |
| 0665 | 非递减数列 | checkPossibility | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0665.checkPossibility.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0665.checkPossibility.go_test.go) |
| 0671 | 二叉树中第二小的节点 | second-minimum-node-in-a-binary-tree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0671\0671.second-minimum-node-in-a-binary-tree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0671\0671.second-minimum-node-in-a-binary-tree.go_test.go) |
| 0674 | 最长连续递增序列 | findLengthOfLCIS | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0674.findLengthOfLCIS.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0674.findLengthOfLCIS.go_test.go) |
| 0679 | 24 点游戏 | judgePoint24 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0679.judgePoint24.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0679.judgePoint24.go_test.go) |
| 0684 | 冗余连接 | findRedundantConnection | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0684.findRedundantConnection.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0684.findRedundantConnection.go_test.go) |
| 0685 | 冗余连接 II | findRedundantDirectedConnection | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0685.findRedundantDirectedConnection.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0685.findRedundantDirectedConnection.go_test.go) |
| 0686 | 重复叠加字符串匹配 | repeatedStringMatch | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0686.repeatedStringMatch.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0686.repeatedStringMatch.go_test.go) |
| 0690 | 员工的重要性 | getImportance | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0690\0690.getImportance.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0690\0690.getImportance.go_test.go) |
| 0692 | 前K个高频单词 | topKFrequent | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0692\0692.topKFrequent.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0692\0692.topKFrequent.go_test.go) |
| 0696 | 计数二进制子串 | countBinarySubstrings | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0696.countBinarySubstrings.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0696.countBinarySubstrings.go_test.go) |
| 0697 | 数组的度 | findShortestSubArray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0697.findShortestSubArray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0697.findShortestSubArray.go_test.go) |
| 0701 | 二叉搜索树中的插入操作 | insertIntoBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0701.insertIntoBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0701.insertIntoBST.go_test.go) |
| 0703 | 数据流中的第 K 大元素 | KthLargest | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0703\0703.KthLargest.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0703\0703.KthLargest.go_test.go) |
| 0705 | 设计哈希集合 | MyHashSet | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0705\0705.MyHashSet.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0705\0705.MyHashSet.go_test.go) |
| 0706 | 设计哈希映射 | MyHashMap | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0706\0706.MyHashMap.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0706\0706.MyHashMap.go_test.go) |
| 0714 | 买卖股票的最佳时机含手续费 | maxProfit | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0714.maxProfit.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0714.maxProfit.go_test.go) |
| 0721 | 账户合并 | accountsMerge | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0721.accountsMerge.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0721.accountsMerge.go_test.go) |
| 0724 | 寻找数组的中心索引 | pivotIndex | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0724.pivotIndex.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0724.pivotIndex.go_test.go) |
| 0726 | 原子的数量 | number-of-atoms | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0726\0726.number-of-atoms.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0726\0726.number-of-atoms.go_test.go) |
| 0733 | 图像渲染 | floodFill | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0733.floodFill.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0733.floodFill.go_test.go) |
| 0738 | 单调递增的数字 | monotoneIncreasingDigits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0738.monotoneIncreasingDigits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0738.monotoneIncreasingDigits.go_test.go) |
| 0740 | 删除并获得点数 | deleteAndEarn | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0740\0740.deleteAndEarn.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0740\0740.deleteAndEarn.go_test.go) |
| 0743 | 网络延迟时间 | network-delay-time | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0743\0743.network-delay-time.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0743\0743.network-delay-time.go_test.go) |
| 0746 | 使用最小花费爬楼梯 | minCostClimbingStairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0746.minCostClimbingStairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0746.minCostClimbingStairs.go_test.go) |
| 0752 | 打开转盘锁 | open-the-lock | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0752\0752.open-the-lock.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0752\0752.open-the-lock.go_test.go) |
| 0763 | 划分字母区间 | partitionLabels | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0763.partitionLabels.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0763.partitionLabels.go_test.go) |
| 0765 | 情侣牵手 | minSwapsCouples | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0765.minSwapsCouples.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0765.minSwapsCouples.go_test.go) |
| 0766 | 托普利茨矩阵 | isToeplitzMatrix | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0766.isToeplitzMatrix.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0766.isToeplitzMatrix.go_test.go) |
| 0767 | 重构字符串 | reorganizeString | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0767.reorganizeString.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0767.reorganizeString.go_test.go) |
| 0771 | 宝石与石头 | numJewelsInStones | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0771.numJewelsInStones.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0771.numJewelsInStones.go_test.go) |
| 0773 | 滑动谜题 | sliding-puzzle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0773\0773.sliding-puzzle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0773\0773.sliding-puzzle.go_test.go) |
| 0778 | 水位上升的泳池中游泳 | swimInWater | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0778.swimInWater.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0778.swimInWater.go_test.go) |
| 0781 | 森林中的兔子 | numRabbits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0781\0781.numRabbits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0781\0781.numRabbits.go_test.go) |
| 0783 | 二叉搜索树节点最小距离 | minDiffInBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0783\0783.minDiffInBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0783\0783.minDiffInBST.go_test.go) |
| 0802 | 找到最终的安全状态 | find-eventual-safe-states | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0802\0802.find-eventual-safe-states.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0802\0802.find-eventual-safe-states.go_test.go) |
| 0803 | 打砖块 | hitBricks | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0803.hitBricks.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0803.hitBricks.go_test.go) |
| 0804 | 唯一摩尔斯密码词 | uniqueMorseRepresentations | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0804.uniqueMorseRepresentations.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0804.uniqueMorseRepresentations.go_test.go) |
| 0810 | 黑板异或游戏 | xorGame | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0810\0810.xorGame.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0810\0810.xorGame.go_test.go) |
| 0815 | 公交路线 | bus-routes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0815\0815.bus-routes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0815\0815.bus-routes.go_test.go) |
| 0830 | 较大分组的位置 | numSimilarGroups | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0830.numSimilarGroups.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0830.numSimilarGroups.go_test.go) |
| 0832 | 翻转图像 | flipAndInvertImage | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0832.flipAndInvertImage.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0832.flipAndInvertImage.go_test.go) |
| 0834 | 树中距离之和 | sumOfDistancesInTree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0834.sumOfDistancesInTree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0834.sumOfDistancesInTree.go_test.go) |
| 0839 | 相似字符串组 | numSimilarGroups | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0839.numSimilarGroups.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0839.numSimilarGroups.go_test.go) |
| 0840 | 矩阵中的幻方 | numMagicSquaresInside | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0840.numMagicSquaresInside.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0840.numMagicSquaresInside.go_test.go) |
| 0841 | 钥匙和房间 | canVisitAllRooms | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0841.canVisitAllRooms.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0841.canVisitAllRooms.go_test.go) |
| 0842 | 将数组拆分成斐波那契序列 | splitIntoFibonacci | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0842.splitIntoFibonacci.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0842.splitIntoFibonacci.go_test.go) |
| 0844 | 比较含退格的字符串 | backspaceCompare | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0844.backspaceCompare.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0844.backspaceCompare.go_test.go) |
| 0845 | 数组中的最长山脉 | longestMountain | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0845.longestMountain.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0845.longestMountain.go_test.go) |
| 0847 | 访问所有节点的最短路径 | shortest-path-visiting-all-nodes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0847\0847.shortest-path-visiting-all-nodes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0847\0847.shortest-path-visiting-all-nodes.go_test.go) |
| 0852 | 山脉数组的峰顶索引 | peakIndexInMountainArray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0852\0852.peakIndexInMountainArray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0852\0852.peakIndexInMountainArray.go_test.go) |
| 0860 | 柠檬水找零 | lemonadeChange | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0860.lemonadeChange.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0860.lemonadeChange.go_test.go) |
| 0861 | 翻转矩阵后的得分 | matrixScore | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0861.matrixScore.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0861.matrixScore.go_test.go) |
| 0863 | 二叉树中所有距离为 K 的结点 | all-nodes-distance-k-in-binary-tree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0863\0863.all-nodes-distance-k-in-binary-tree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0863\0863.all-nodes-distance-k-in-binary-tree.go_test.go) |
| 0867 | 转置矩阵 | transpose | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0867.transpose.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0867.transpose.go_test.go) |
| | 叶子相似的树 | 0872 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0872\0872.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0872\0872.go_test.go) |
| 0874 | 模拟行走机器人 | robotSim | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0874.robotSim.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0874.robotSim.go_test.go) |
| 0877 | 石子游戏 | stoneGame | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0877\0877.stoneGame.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0877\0877.stoneGame.go_test.go) |
| 0879 | 盈利计划 | profitableSchemes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0879\0879.profitableSchemes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0879\0879.profitableSchemes.go_test.go) |
| 0888 | 公平的糖果棒交换 | fairCandySwap | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0888.fairCandySwap.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0888.fairCandySwap.go_test.go) |
| 0896 | 单调数列 | isMonotonic | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0896.isMonotonic.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0896.isMonotonic.go_test.go) |
| 0897 | 递增顺序搜索树 | increasingBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0897\0897.increasingBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0897\0897.increasingBST.go_test.go) |
| 0909 | 蛇梯棋 | snakes-and-ladders | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0909\0909.snakes-and-ladders.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0909\0909.snakes-and-ladders.go_test.go) |
| 0922 | 按奇偶排序数组 II | sortArrayByParityII | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0922.sortArrayByParityII.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0922.sortArrayByParityII.go_test.go) |
| 0925 | 长按键入 | isLongPressedName | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0925.isLongPressedName.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0925.isLongPressedName.go_test.go) |
| 0930 | 和相同的二元子数组 | binary-subarrays-with-sum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0930\0930.binary-subarrays-with-sum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0930\0930.binary-subarrays-with-sum.go_test.go) |
| 0938 | 二叉搜索树的范围和 | rangeSumBST | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0938\0938.rangeSumBST.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0938\0938.rangeSumBST.go_test.go) |
| 0941 | 有效的山脉数组 | validMountainArray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0941.validMountainArray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0941.validMountainArray.go_test.go) |
| 0947 | 移除最多的同行或同列石头 | removeStones | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0947.removeStones.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0947.removeStones.go_test.go) |
| 0949 | 给定数字能组成的最大时间 | largestTimeFromDigits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0949.largestTimeFromDigits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0949.largestTimeFromDigits.go_test.go) |
| 0959 | 由斜杠划分区域 | regionsBySlashes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0959.regionsBySlashes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0959.regionsBySlashes.go_test.go) |
| 0968 | 监控二叉树 | minCameraCover | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0968.minCameraCover.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0968.minCameraCover.go_test.go) |
| 0973 | 最接近原点的 K 个点 | kClosest | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0973.kClosest.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0973.kClosest.go_test.go) |
| 0976 | 三角形的最大周长 | largestPerimeter | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0976.largestPerimeter.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0976.largestPerimeter.go_test.go) |
| 0977 | 有序数组的平方 | sortedSquares | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0977.sortedSquares.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0977.sortedSquares.go_test.go) |
| 0978 | 最长湍流子数组 | maxTurbulenceSize | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0978.maxTurbulenceSize.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0978.maxTurbulenceSize.go_test.go) |
| 0981 | 基于时间的键值存储 | time-based-key-value-store | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0981\0981.time-based-key-value-store.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0981\0981.time-based-key-value-store.go_test.go) |
| 0987 | 二叉树的垂序遍历 | vertical-order-traversal-of-a-binary-tree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0987\0987.vertical-order-traversal-of-a-binary-tree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0987\0987.vertical-order-traversal-of-a-binary-tree.go_test.go) |
| 0989 | 数组形式的整数加法 | addToArrayForm | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0989.addToArrayForm.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0989.addToArrayForm.go_test.go) |
| 0992 | K 个不同整数的子数组 | subarraysWithKDistinct | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0992.subarraysWithKDistinct.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0992.subarraysWithKDistinct.go_test.go) |
| 0993 | 二叉树的堂兄弟节点 | isCousins | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0993\0993.isCousins.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0993\0993.isCousins.go_test.go) |
| 0995 | K 连续位的最小翻转次数 | minKBitFlips | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0995.minKBitFlips.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\0995.minKBitFlips.go_test.go) |
| 1004 | 最大连续1的个数 III | longestOnes | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1004.longestOnes.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1004.longestOnes.go_test.go) |
| 1006 | 笨阶乘 | clumsy | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1006\1006.clumsy.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1006\1006.clumsy.go_test.go) |
| 1011 | 在 D 天内送达包裹的能力 | shipWithinDays | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1011\1011.shipWithinDays.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1011\1011.shipWithinDays.go_test.go) |
| 1018 | 可被 5 整除的二进制前缀 | prefixesDivBy5 | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1018.prefixesDivBy5.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1018.prefixesDivBy5.go_test.go) |
| 1021 | 删除最外层的括号 | removeOuterParentheses | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1021.removeOuterParentheses.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1021.removeOuterParentheses.go_test.go) |
| 1024 | 视频拼接 | videoStitching | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1024.videoStitching.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1024.videoStitching.go_test.go) |
| 1030 | 距离顺序排列矩阵单元格 | allCellsDistOrder | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1030.allCellsDistOrder.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1030.allCellsDistOrder.go_test.go) |
| 1035 | 不相交的线 | maxUncrossedLines | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1035\1035.maxUncrossedLines.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1035\1035.maxUncrossedLines.go_test.go) |
| 1046 | 最后一块石头的重量 | lastStoneWeight | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1046.lastStoneWeight.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1046.lastStoneWeight.go_test.go) |
| 1047 | 删除字符串中的所有相邻重复项 | removeDuplicates | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1047.removeDuplicates.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1047.removeDuplicates.go_test.go) |
| 1049 | 最后一块石头的重量 II | lastStoneWeightII | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1049\1049.lastStoneWeightII.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1049\1049.lastStoneWeightII.go_test.go) |
| | 最后一块石头的重量 II | README | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1049\README.MD.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1049\README.MD_test.go) |
| 1051 | 高度检查器 | heightChecker | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1051.heightChecker.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1051.heightChecker.go_test.go) |
| 1052 | 爱生气的书店老板 | maxSatisfied | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1052.maxSatisfied.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1052.maxSatisfied.go_test.go) |
| 1074 | 元素和为目标值的子矩阵数量 | numSubmatrixSumTarget | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1074\1074.numSubmatrixSumTarget.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1074\1074.numSubmatrixSumTarget.go_test.go) |
| 1104 | 二叉树寻路 | path-in-zigzag-labelled-binary-tree | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1104\1104.path-in-zigzag-labelled-binary-tree.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1104\1104.path-in-zigzag-labelled-binary-tree.go_test.go) |
| 1108 | IP 地址无效化 | defangIPaddr | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1108.defangIPaddr.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1108.defangIPaddr.go_test.go) |
| 1122 | 数组的相对排序 | relativeSortArray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1122.relativeSortArray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1122.relativeSortArray.go_test.go) |
| 1128 | 等价多米诺骨牌对的数量 | numEquivDominoPairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1128.numEquivDominoPairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1128.numEquivDominoPairs.go_test.go) |
| 1137 | 第 N 个泰波那契数 | n-th-tribonacci-number | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1137\1137.n-th-tribonacci-number.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1137\1137.n-th-tribonacci-number.go_test.go) |
| 11433 | 最长公共子序列 | longestCommonSubsequence | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1143\11433.longestCommonSubsequence.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1143\11433.longestCommonSubsequence.go_test.go) |
| 1178 | 猜字谜 | findNumOfValidWords | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1178.findNumOfValidWords.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1178.findNumOfValidWords.go_test.go) |
| 1190 | 反转每对括号间的子串 | reverseParentheses | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1190\1190.reverseParentheses.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1190\1190.reverseParentheses.go_test.go) |
| 1202 | 交换字符串中的元素 | smallestStringWithSwaps | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1202.smallestStringWithSwaps.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1202.smallestStringWithSwaps.go_test.go) |
| 1203 | 项目管理 | sortItems | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1203.sortItems.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1203.sortItems.go_test.go) |
| 1207 | 独一无二的出现次数 | uniqueOccurrences | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1207.uniqueOccurrences.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1207.uniqueOccurrences.go_test.go) |
| 1208 | 尽可能使字符串相等 | equalSubstring | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1208.equalSubstring.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1208.equalSubstring.go_test.go) |
| 1232 | 缀点成线 | checkStraightLine | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1232.checkStraightLine.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1232.checkStraightLine.go_test.go) |
| 1239 | 串联字符串的最大长度 | maximum-length-of-a-concatenated-string-with-unique-characters | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1239\1239.maximum-length-of-a-concatenated-string-with-unique-characters.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1239\1239.maximum-length-of-a-concatenated-string-with-unique-characters.go_test.go) |
| 1269 | 停在原地的方案数 | numWays | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1269\1269.numWays.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1269\1269.numWays.go_test.go) |
| 1299 | 将每个元素替换为右侧最大元素 | replaceElements | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1299.replaceElements.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1299.replaceElements.go_test.go) |
| 1310 | 子数组异或查询 | xorQueries | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1310\1310.xorQueries.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1310\1310.xorQueries.go_test.go) |
| 1319 | 连通网络的操作次数 | makeConnected | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1319.makeConnected.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1319.makeConnected.go_test.go) |
| 1337 | 矩阵中战斗力最弱的 K 行 | the-k-weakest-rows-in-a-matrix | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1337\1337.the-k-weakest-rows-in-a-matrix.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1337\1337.the-k-weakest-rows-in-a-matrix.go_test.go) |
| 1351 | 统计有序矩阵中的负数 | countNegatives | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1351.countNegatives.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1351.countNegatives.go_test.go) |
| 1356 | 根据数字二进制下 1 的数目排序 | sortByBits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1356.sortByBits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1356.sortByBits.go_test.go) |
| 1365 | 有多少小于当前数字的数字 | smallerNumbersThanCurrent | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1365.smallerNumbersThanCurrent.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1365.smallerNumbersThanCurrent.go_test.go) |
| 1418 | 点菜展示表 | display-table-of-food-orders-in-a-restaurant | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1418\1418.display-table-of-food-orders-in-a-restaurant.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1418\1418.display-table-of-food-orders-in-a-restaurant.go_test.go) |
| 1423 | 可获得的最大点数 | maxScore | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1423.maxScore.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1423.maxScore.go_test.go) |
| 1431 | 拥有最多糖果的孩子 | kidsWithCandies | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1431.kidsWithCandies.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1431.kidsWithCandies.go_test.go) |
| 1438 | 绝对差不超过限制的最长连续子数组 | longestSubarray | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1438.longestSubarray.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1438.longestSubarray.go_test.go) |
| 1442 | 形成两个异或相等数组的三元组数目 | countTriplets | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1442\1442.countTriplets.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1442\1442.countTriplets.go_test.go) |
| 1449 | 数位成本和为目标值的最大数字 | largestNumber | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1449\1449.largestNumber.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1449\1449.largestNumber.go_test.go) |
| 1470 | 重新排列数组 | shuffle | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1470.shuffle.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1470.shuffle.go_test.go) |
| 1473 | 粉刷房子 III | minCost | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1473\1473.minCost.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1473\1473.minCost.go_test.go) |
| 1480 | 一维数组的动态和 | runningSum | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1480.runningSum.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1480.runningSum.go_test.go) |
| 1482 | 制作 m 束花所需的最少天数 | minDays | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1482\1482.minDays.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1482\1482.minDays.go_test.go) |
| 1486 | 数组异或操作 | xorOperation | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1486\1486.xorOperation.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1486\1486.xorOperation.go_test.go) |
| 1486 | 数组异或操作 | xorOperation | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1486.xorOperation.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1486.xorOperation.go_test.go) |
| 1489 | 找到最小生成树里的关键边和伪关键边 | findCriticalAndPseudoCriticalEdges | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1489.findCriticalAndPseudoCriticalEdges.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1489.findCriticalAndPseudoCriticalEdges.go_test.go) |
| 1496 | 判断路径是否相交 | isPathCrossing | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1496.isPathCrossing.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1496.isPathCrossing.go_test.go) |
| 1502 | 判断能否形成等差数列 | canMakeArithmeticProgression | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1502.canMakeArithmeticProgression.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1502.canMakeArithmeticProgression.go_test.go) |
| 1507 | 转变日期格式 | reformatDate | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1507.reformatDate.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1507.reformatDate.go_test.go) |
| 1512 | 好数对的数目 | numIdenticalPairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1512.numIdenticalPairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1512.numIdenticalPairs.go_test.go) |
| 1539 | 第 k 个缺失的正整数 | findKthPositive | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1539.findKthPositive.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1539.findKthPositive.go_test.go) |
| 1544 | 整理字符串 | makeGood | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1544.makeGood.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1544.makeGood.go_test.go) |
| 1550 | 存在连续三个奇数的数组 | threeConsecutiveOdds | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1550.threeConsecutiveOdds.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1550.threeConsecutiveOdds.go_test.go) |
| 1563 | 石子游戏 V | stoneGameV | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1563.stoneGameV.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1563.stoneGameV.go_test.go) |
| 1573 | 分割字符串的方案数 | numWays | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1573.numWays.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1573.numWays.go_test.go) |
| 1579 | 保证图可完全遍历 | maxNumEdgesToRemove | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1579.maxNumEdgesToRemove.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1579.maxNumEdgesToRemove.go_test.go) |
| 1583 | 统计不开心的朋友 | count-unhappy-friends | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1583\1583.count-unhappy-friends.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1583\1583.count-unhappy-friends.go_test.go) |
| 1584 | 连接所有点的最小费用 | minCostConnectPoints | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1584.minCostConnectPoints.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1584.minCostConnectPoints.go_test.go) |
| 1600 | 皇位继承顺序 | throne-inheritance | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1600\1600.throne-inheritance.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1600\1600.throne-inheritance.go_test.go) |
| 1603 | 设计停车系统 | ParkingSystem | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1603\1603.ParkingSystem.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1603\1603.ParkingSystem.go_test.go) |
| 1631 | 最小体力消耗路径 | minimumEffortPath | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1631.minimumEffortPath.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1631.minimumEffortPath.go_test.go) |
| 1707 | 与数组中元素的最大异或值 | maximizeXor | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1707\1707.maximizeXor.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1707\1707.maximizeXor.go_test.go) |
| 1711 | 大餐计数 | count-good-meals | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1711\1711.count-good-meals.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1711\1711.count-good-meals.go_test.go) |
| 1713 | 得到子序列的最少操作次数 | minimum-operations-to-make-a-subsequence | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1713\1713.minimum-operations-to-make-a-subsequence.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1713\1713.minimum-operations-to-make-a-subsequence.go_test.go) |
| 1720 | 解码异或后的数组 | decode | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1720\1720.decode.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1720\1720.decode.go_test.go) |
| 1722 | 执行交换操作后的最小汉明距离 | minimumHammingDistance | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1722.minimumHammingDistance.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1722.minimumHammingDistance.go_test.go) |
| 1723 | 完成所有工作的最短时间 | minimumTimeRequired | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1723\1723.minimumTimeRequired.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1723\1723.minimumTimeRequired.go_test.go) |
| 1734 | 解码异或后的排列 | decode | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1734\1734.decode.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1734\1734.decode.go_test.go) |
| 1736 | 替换隐藏数字得到的最晚时间 | latest-time-by-replacing-hidden-digits | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1736\1736.latest-time-by-replacing-hidden-digits.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1736\1736.latest-time-by-replacing-hidden-digits.go_test.go) |
| 1738 | 找出第 K 大的异或坐标值 | kthLargestValue | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1738\1738.kthLargestValue.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1738\1738.kthLargestValue.go_test.go) |
| 1743 | 从相邻元素对还原数组 | restore-the-array-from-adjacent-pairs | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1743\1743.restore-the-array-from-adjacent-pairs.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1743\1743.restore-the-array-from-adjacent-pairs.go_test.go) |
| 1744 | 你能在你最喜欢的那天吃到你最喜欢的糖果吗？ | can-you-eat-your-favorite-candy-on-your-favorite-day | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1744\1744.can-you-eat-your-favorite-candy-on-your-favorite-day.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1744\1744.can-you-eat-your-favorite-candy-on-your-favorite-day.go_test.go) |
| 1787 | 使所有区间的异或结果为零 | minChanges | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1787\1787.minChanges.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1787\1787.minChanges.go_test.go) |
| 1818 | 绝对差值和 | minimum-absolute-sum-difference | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1818\1818.minimum-absolute-sum-difference.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1818\1818.minimum-absolute-sum-difference.go_test.go) |
| 1833 | 雪糕的最大数量 | maximum-ice-cream-bars | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1833\1833.maximum-ice-cream-bars.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1833\1833.maximum-ice-cream-bars.go_test.go) |
| 1838 | 最高频元素的频数 | frequency-of-the-most-frequent-element | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1838\1838.frequency-of-the-most-frequent-element.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1838\1838.frequency-of-the-most-frequent-element.go_test.go) |
| 1846 | 减小和重新排列数组后的最大元素 | maximum-element-after-decreasing-and-rearranging | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1846\1846.maximum-element-after-decreasing-and-rearranging.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1846\1846.maximum-element-after-decreasing-and-rearranging.go_test.go) |
| 1877 | 数组中最大数对和的最小值 | minimize-maximum-pair-sum-in-array | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1877\1877.minimize-maximum-pair-sum-in-array.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1877\1877.minimize-maximum-pair-sum-in-array.go_test.go) |
| 1893 | 检查是否区域内所有整数都被覆盖 | check-if-all-the-integers-in-a-range-are-covered | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1893\1893.check-if-all-the-integers-in-a-range-are-covered.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\1893\1893.check-if-all-the-integers-in-a-range-are-covered.go_test.go) |
| InterviewQuestion_10_02 | | group-anagrams-lcci | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\InterviewQuestion_10_02\InterviewQuestion_10_02.group-anagrams-lcci.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\InterviewQuestion_10_02\InterviewQuestion_10_02.group-anagrams-lcci.go_test.go) |
| InterviewQuestion_17_10 | | find-majority-element-lcci | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\InterviewQuestion_17_10\InterviewQuestion_17_10.find-majority-element-lcci.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\InterviewQuestion_17_10\InterviewQuestion_17_10.find-majority-element-lcci.go_test.go) |
| LCP_07 | 传递信息 | chuan-di-xin-xi | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\LCP_07\LCP_07.chuan-di-xin-xi.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\LCP_07\LCP_07.chuan-di-xin-xi.go_test.go) |
| SwordRefers_Offer_53_I | | zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\SwordRefers_Offer_53_I\SwordRefers_Offer_53_I.zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\SwordRefers_Offer_53_I\SwordRefers_Offer_53_I.zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.go_test.go) |
| 剑指_Offer_15 | 二进制中1的个数 | er-jin-zhi-zhong-1de-ge-shu-lcof | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_15\剑指_Offer_15.er-jin-zhi-zhong-1de-ge-shu-lcof.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_15\剑指_Offer_15.er-jin-zhi-zhong-1de-ge-shu-lcof.go_test.go) |
| 剑指_Offer_37 | 序列化二叉树 | xu-lie-hua-er-cha-shu-lcof | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_37\剑指_Offer_37.xu-lie-hua-er-cha-shu-lcof.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_37\剑指_Offer_37.xu-lie-hua-er-cha-shu-lcof.go_test.go) |
| 剑指_Offer_38 | 字符串的排列 | zi-fu-chuan-de-pai-lie-lcof | [GO](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_38\剑指_Offer_38.zi-fu-chuan-de-pai-lie-lcof.go.go) | [TEST](https://github.com/godcong/leetcode/blob/master/E:\workspace\project\leetcode\code\剑指_Offer_38\剑指_Offer_38.zi-fu-chuan-de-pai-lie-lcof.go_test.go) |