Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/gaufung/leetcode-solutions

leetcode-solution
https://github.com/gaufung/leetcode-solutions
alogrithms data-structures golang leetocde
Last synced: 1 day ago
JSON representation
leetcode-solution
Host: GitHub
URL: https://github.com/gaufung/leetcode-solutions
Owner: gaufung
License: mit
Created: 2018-03-04T01:29:01.000Z (almost 7 years ago)
Default Branch: master
Last Pushed: 2022-01-12T11:25:52.000Z (almost 3 years ago)
Last Synced: 2024-11-07T18:02:25.275Z (about 2 months ago)
Topics: alogrithms, data-structures, golang, leetocde
Language: Go
Size: 518 KB
Stars: 6
Watchers: 3
Forks: 1
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

        
# LeetCode Solution

[Leetcode](https://leetcode-cn.com/problemset/all/) algorithm or database problemset.

Problem | Solution | Level

:---|:---:|:--:

[1 两数之和](https://leetcode-cn.com/problems/two-sum/description/)|[golang](./Algorithm/1.两数之和.go)|Easy

[2 两数相加](https://leetcode-cn.com/problems/add-two-numbers/description/)|[golang](./Algorithm/2.两数相加.go)|Medium

[3 无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/description/)|[golang](./Algorithm/3.无重复字符的最长子串.go)|Medium

[4 寻找两个有序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/description/)|[golang](./Algorithm/4.寻找两个有序数组的中位数.go)|Hard

[5 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/description/)|[golang](./Algorithm/5.最长回文子串.go)|Medium

[6 z-字形变换](https://leetcode-cn.com/problems/zigzag-conversion/description/)|[golang](./Algorithm/6.z-字形变换.go)|Medium

[7 整数反转](https://leetcode-cn.com/problems/reverse-integer/description/)|[golang](./Algorithm/7.整数反转.go)|Easy

[8 字符串转换整数-atoi](https://leetcode-cn.com/problems/string-to-integer-atoi/description/)|[golang](./Algorithm/8.字符串转换整数-atoi.go)|Medium

[9 回文数](https://leetcode-cn.com/problems/palindrome-number/description/)|[golang](./Algorithm/9.回文数.go)|Easy

[11 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/description/)|[golang](./Algorithm/11.盛最多水的容器.go)|Medium

[13 罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer/description/)|[golang](./Algorithm/13.罗马数字转整数.go)|Easy

[14 最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/description/)|[golang](./Algorithm/14.最长公共前缀.go)|Easy

[15 三数之和](https://leetcode-cn.com/problems/3sum/description/)|[golang](./Algorithm/15.三数之和.go)|Medium

[16 最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/description/)|[golang](./Algorithm/16.最接近的三数之和.go)|Medium

[17 电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/description/)|[golang](./Algorithm/17.电话号码的字母组合.go)|Medium

[18 四数之和](https://leetcode-cn.com/problems/4sum/description/)|[golang](./Algorithm/18.四数之和.go)|Medium

[19 删除链表的倒数第n个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/description/)|[golang](./Algorithm/19.删除链表的倒数第n个节点.go)|Medium

[20 有效的括号](https://leetcode-cn.com/problems/valid-parentheses/description/)|[golang](./Algorithm/20.有效的括号.go)|Easy

[21 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/description/)|[golang](./Algorithm/21.合并两个有序链表.go)|Easy

[22 括号生成](https://leetcode-cn.com/problems/generate-parentheses/description/)|[golang](./Algorithm/22.括号生成.go)|Medium

[23 合并k个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/description/)|[golang](./Algorithm/23.合并k个排序链表.go)|Hard

[24 两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/description/)|[golang](./Algorithm/24.两两交换链表中的节点.go)|Medium

[25 k个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/description/)|[golang](./Algorithm/25.k个一组翻转链表.go)|Hard

[26 删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/description/)|[golang](./Algorithm/26.删除排序数组中的重复项.go)|Easy

[27 移除元素](https://leetcode-cn.com/problems/remove-element/description/)|[golang](./Algorithm/27.移除元素.go)|Easy

[28 实现str-str](https://leetcode-cn.com/problems/implement-strstr/description/)|[golang](./Algorithm/28.实现str-str.go)|Easy

[31 下一个排列](https://leetcode-cn.com/problems/next-permutation/description/)|[golang](./Algorithm/31.下一个排列.go)|Medium

[32 最长有效括号](https://leetcode-cn.com/problems/longest-valid-parentheses/description/)|[golang](./Algorithm/32.最长有效括号.go)|Hard

[33 搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/description/)|[golang](./Algorithm/33.搜索旋转排序数组.go)|Medium

[34 在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/)|[golang](./Algorithm/34.在排序数组中查找元素的第一个和最后一个位置.go)|Medium

[35 搜索插入位置](https://leetcode-cn.com/problems/search-insert-position/description/)|[golang](./Algorithm/35.搜索插入位置.go)|Easy

[36 有效的数独](https://leetcode-cn.com/problems/valid-sudoku/description/)|[golang](./Algorithm/36.有效的数独.go)|Medium

[37 解数独](https://leetcode-cn.com/problems/sudoku-solver/description/)|[golang](./Algorithm/37.解数独.go)|Hard

[38 报数](https://leetcode-cn.com/problems/count-and-say/description/)|[golang](./Algorithm/38.报数.go)|Easy

[39 组合总和](https://leetcode-cn.com/problems/combination-sum/description/)|[golang](./Algorithm/39.组合总和.go)|Medium

[40 组合总和-ii](https://leetcode-cn.com/problems/combination-sum-ii/description/)|[golang](./Algorithm/40.组合总和-ii.go)|Medium

[41 缺失的第一个正数](https://leetcode-cn.com/problems/first-missing-positive/description/)|[golang](./Algorithm/41.缺失的第一个正数.go)|Hard

[42 接雨水](https://leetcode-cn.com/problems/trapping-rain-water/description/)|[golang](./Algorithm/42.接雨水.go)|Hard

[43 字符串相乘](https://leetcode-cn.com/problems/multiply-strings/description/)|[golang](./Algorithm/43.字符串相乘.go)|Medium

[45 跳跃游戏-ii](https://leetcode-cn.com/problems/jump-game-ii/description/)|[golang](./Algorithm/45.跳跃游戏-ii.go)|Hard

[46 全排列](https://leetcode-cn.com/problems/permutations/description/)|[golang](./Algorithm/46.全排列.go)|Medium

[47 全排列-ii](https://leetcode-cn.com/problems/permutations-ii/description/)|[golang](./Algorithm/47.全排列-ii.go)|Medium

[48 旋转图像](https://leetcode-cn.com/problems/rotate-image/description/)|[golang](./Algorithm/48.旋转图像.go)|Medium

[49 字母异位词分组](https://leetcode-cn.com/problems/group-anagrams/description/)|[golang](./Algorithm/49.字母异位词分组.go)|Medium

[50 pow-x-n](https://leetcode-cn.com/problems/powx-n/description/)|[golang](./Algorithm/50.pow-x-n.go)|Medium

[51 n皇后](https://leetcode-cn.com/problems/n-queens/description/)|[golang](./Algorithm/51.n皇后.go)|Hard

[52 n皇后-ii](https://leetcode-cn.com/problems/n-queens-ii/description/)|[golang](./Algorithm/52.n皇后-ii.go)|Hard

[53 最大子序和](https://leetcode-cn.com/problems/maximum-subarray/description/)|[golang](./Algorithm/53.最大子序和.go)|Easy

[54 螺旋矩阵](https://leetcode-cn.com/problems/spiral-matrix/description/)|[golang](./Algorithm/54.螺旋矩阵.go)|Medium

[55 跳跃游戏](https://leetcode-cn.com/problems/jump-game/description/)|[golang](./Algorithm/55.跳跃游戏.go)|Medium

[56 合并区间](https://leetcode-cn.com/problems/merge-intervals/description/)|[golang](./Algorithm/56.合并区间.go)|Medium

[57 插入区间](https://leetcode-cn.com/problems/insert-interval/description/)|[golang](./Algorithm/57.插入区间.go)|Hard

[58 最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word/description/)|[golang](./Algorithm/58.最后一个单词的长度.go)|Easy

[59 螺旋矩阵-ii](https://leetcode-cn.com/problems/spiral-matrix-ii/description/)|[golang](./Algorithm/59.螺旋矩阵-ii.go)|Medium

[60 第k个排列](https://leetcode-cn.com/problems/permutation-sequence/description/)|[golang](./Algorithm/60.第k个排列.go)|Medium

[61 旋转链表](https://leetcode-cn.com/problems/rotate-list/description/)|[golang](./Algorithm/61.旋转链表.go)|Medium

[62 不同路径](https://leetcode-cn.com/problems/unique-paths/description/)|[golang](./Algorithm/62.不同路径.go)|Medium

[63 不同路径-ii](https://leetcode-cn.com/problems/unique-paths-ii/description/)|[golang](./Algorithm/63.不同路径-ii.go)|Medium

[64 最小路径和](https://leetcode-cn.com/problems/minimum-path-sum/description/)|[golang](./Algorithm/64.最小路径和.go)|Medium

[66 加一](https://leetcode-cn.com/problems/plus-one/description/)|[golang](./Algorithm/66.加一.go)|Easy

[67 二进制求和](https://leetcode-cn.com/problems/add-binary/description/)|[golang](./Algorithm/67.二进制求和.go)|Easy

[69 x-的平方根](https://leetcode-cn.com/problems/sqrtx/description/)|[golang](./Algorithm/69.x-的平方根.go)|Easy

[70 爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/description/)|[golang](./Algorithm/70.爬楼梯.go)|Easy

[71 简化路径](https://leetcode-cn.com/problems/simplify-path/description/)|[golang](./Algorithm/71.简化路径.go)|Medium

[72 编辑距离](https://leetcode-cn.com/problems/edit-distance/description/)|[golang](./Algorithm/72.编辑距离.go)|Hard

[73 矩阵置零](https://leetcode-cn.com/problems/set-matrix-zeroes/description/)|[golang](./Algorithm/73.矩阵置零.go)|Medium

[74 搜索二维矩阵](https://leetcode-cn.com/problems/search-a-2d-matrix/description/)|[golang](./Algorithm/74.搜索二维矩阵.go)|Medium

[75 颜色分类](https://leetcode-cn.com/problems/sort-colors/description/)|[golang](./Algorithm/75.颜色分类.go)|Medium

[77 组合](https://leetcode-cn.com/problems/combinations/description/)|[golang](./Algorithm/77.组合.go)|Medium

[78 子集](https://leetcode-cn.com/problems/subsets/description/)|[golang](./Algorithm/78.子集.go)|Medium

[79 单词搜索](https://leetcode-cn.com/problems/word-search/description/)|[golang](./Algorithm/79.单词搜索.go)|Medium

[80 删除排序数组中的重复项-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii/description/)|[golang](./Algorithm/80.删除排序数组中的重复项-ii.go)|Medium

[82 删除排序链表中的重复元素-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/description/)|[golang](./Algorithm/82.删除排序链表中的重复元素-ii.go)|Medium

[83 删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/description/)|[golang](./Algorithm/83.删除排序链表中的重复元素.go)|Easy

[85 最大矩形](https://leetcode-cn.com/problems/maximal-rectangle/description/)|[golang](./Algorithm/85.最大矩形.go)|Hard

[86 分隔链表](https://leetcode-cn.com/problems/partition-list/description/)|[golang](./Algorithm/86.分隔链表.go)|Medium

[88 合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array/description/)|[golang](./Algorithm/88.合并两个有序数组.go)|Easy

[89 格雷编码](https://leetcode-cn.com/problems/gray-code/description/)|[golang](./Algorithm/89.格雷编码.go)|Medium

[90 子集-ii](https://leetcode-cn.com/problems/subsets-ii/description/)|[golang](./Algorithm/90.子集-ii.go)|Medium

[91 解码方法](https://leetcode-cn.com/problems/decode-ways/description/)|[golang](./Algorithm/91.解码方法.go)|Medium

[92 反转链表-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/description/)|[golang](./Algorithm/92.反转链表-ii.go)|Medium

[93 复原ip地址](https://leetcode-cn.com/problems/restore-ip-addresses/description/)|[golang](./Algorithm/93.复原ip地址.go)|Medium

[94 二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/)|[golang](./Algorithm/94.二叉树的中序遍历.go)|Medium

[95 不同的二叉搜索树-ii](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/description/)|[golang](./Algorithm/95.不同的二叉搜索树-ii.go)|Medium

[96 不同的二叉搜索树](https://leetcode-cn.com/problems/unique-binary-search-trees/description/)|[golang](./Algorithm/96.不同的二叉搜索树.go)|Medium

[97 交错字符串](https://leetcode-cn.com/problems/interleaving-string/description/)|[golang](./Algorithm/97.交错字符串.go)|Hard

[98 验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree/description/)|[golang](./Algorithm/98.验证二叉搜索树.go)|Medium

[100 相同的树](https://leetcode-cn.com/problems/same-tree/description/)|[golang](./Algorithm/100.相同的树.go)|Easy

[101 对称二叉树](https://leetcode-cn.com/problems/symmetric-tree/description/)|[golang](./Algorithm/101.对称二叉树.go)|Easy

[102 二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/description/)|[golang](./Algorithm/102.二叉树的层次遍历.go)|Medium

[103 二叉树的锯齿形层次遍历](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/description/)|[golang](./Algorithm/103.二叉树的锯齿形层次遍历.go)|Medium

[104 二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/description/)|[golang](./Algorithm/104.二叉树的最大深度.go)|Easy

[105 从前序与中序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/)|[golang](./Algorithm/105.从前序与中序遍历序列构造二叉树.go)|Medium

[106 从中序与后序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/)|[golang](./Algorithm/106.从中序与后序遍历序列构造二叉树.go)|Medium

[107 二叉树的层次遍历-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/description/)|[golang](./Algorithm/107.二叉树的层次遍历-ii.go)|Easy

[108 将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/description/)|[golang](./Algorithm/108.将有序数组转换为二叉搜索树.go)|Easy

[109 有序链表转换二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/description/)|[golang](./Algorithm/109.有序链表转换二叉搜索树.go)|Medium

[110 平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/description/)|[golang](./Algorithm/110.平衡二叉树.go)|Easy

[111 二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/description/)|[golang](./Algorithm/111.二叉树的最小深度.go)|Easy

[112 路径总和](https://leetcode-cn.com/problems/path-sum/description/)|[golang](./Algorithm/112.路径总和.go)|Easy

[113 路径总和-ii](https://leetcode-cn.com/problems/path-sum-ii/description/)|[golang](./Algorithm/113.路径总和-ii.go)|Medium

[114 二叉树展开为链表](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/description/)|[golang](./Algorithm/114.二叉树展开为链表.go)|Medium

[115 不同的子序列](https://leetcode-cn.com/problems/distinct-subsequences/description/)|[golang](./Algorithm/115.不同的子序列.go)|Hard

[116 填充每个节点的下一个右侧节点指针](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/description/)|[python](./Algorithm/116.填充每个节点的下一个右侧节点指针.py)|Medium

[117 填充每个节点的下一个右侧节点指针-ii](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/description/)|[python](./Algorithm/117.填充每个节点的下一个右侧节点指针-ii.py)|Medium

[118 杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/description/)|[golang](./Algorithm/118.杨辉三角.go)|Easy

[119 杨辉三角-ii](https://leetcode-cn.com/problems/pascals-triangle-ii/description/)|[golang](./Algorithm/119.杨辉三角-ii.go)|Easy

[120 三角形最小路径和](https://leetcode-cn.com/problems/triangle/description/)|[golang](./Algorithm/120.三角形最小路径和.go)|Medium

[121 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/description/)|[golang](./Algorithm/121.买卖股票的最佳时机.go)|Easy

[122 买卖股票的最佳时机-ii](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/)|[golang](./Algorithm/122.买卖股票的最佳时机-ii.go)|Easy

[124 二叉树中的最大路径和](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/description/)|[golang](./Algorithm/124.二叉树中的最大路径和.go)|Hard

[125 验证回文串](https://leetcode-cn.com/problems/valid-palindrome/description/)|[golang](./Algorithm/125.验证回文串.go)|Easy

[126 单词接龙-ii](https://leetcode-cn.com/problems/word-ladder-ii/description/)|[golang](./Algorithm/126.单词接龙-ii.go)|Hard

[127 单词接龙](https://leetcode-cn.com/problems/word-ladder/description/)|[golang](./Algorithm/127.单词接龙.go)|Medium

[128 最长连续序列](https://leetcode-cn.com/problems/longest-consecutive-sequence/description/)|[golang](./Algorithm/128.最长连续序列.go)|Hard

[129 求根到叶子节点数字之和](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/description/)|[golang](./Algorithm/129.求根到叶子节点数字之和.go)|Medium

[130 被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions/description/)|[golang](./Algorithm/130.被围绕的区域.go)|Medium

[131 分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/description/)|[golang](./Algorithm/131.分割回文串.go)|Medium

[132 分割回文串-ii](https://leetcode-cn.com/problems/palindrome-partitioning-ii/description/)|[golang](./Algorithm/132.分割回文串-ii.go)|Hard

[133 克隆图](https://leetcode-cn.com/problems/clone-graph/description/)|[python](./Algorithm/133.克隆图.py)|Medium

[134 加油站](https://leetcode-cn.com/problems/gas-station/description/)|[python](./Algorithm/134.加油站.py)|Medium

[136 只出现一次的数字](https://leetcode-cn.com/problems/single-number/description/)|[golang](./Algorithm/136.只出现一次的数字.go)|Easy

[137 只出现一次的数字-ii](https://leetcode-cn.com/problems/single-number-ii/description/)|[golang](./Algorithm/137.只出现一次的数字-ii.go)|Medium

[138 复制带随机指针的链表](https://leetcode-cn.com/problems/copy-list-with-random-pointer/description/)|[python](./Algorithm/138.复制带随机指针的链表.py)|Medium

[139 单词拆分](https://leetcode-cn.com/problems/word-break/description/)|[golang](./Algorithm/139.单词拆分.go)|Medium

[140 单词拆分-ii](https://leetcode-cn.com/problems/word-break-ii/description/)|[golang](./Algorithm/140.单词拆分-ii.go)|Hard

[141 环形链表](https://leetcode-cn.com/problems/linked-list-cycle/description/)|[golang](./Algorithm/141.环形链表.go)|Easy

[142 环形链表-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/description/)|[golang](./Algorithm/142.环形链表-ii.go)|Medium

[143 重排链表](https://leetcode-cn.com/problems/reorder-list/description/)|[golang](./Algorithm/143.重排链表.go)|Medium

[144 二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/)|[golang](./Algorithm/144.二叉树的前序遍历.go)|Medium

[145 二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/description/)|[golang](./Algorithm/145.二叉树的后序遍历.go)|Hard

[146 lru缓存机制](https://leetcode-cn.com/problems/lru-cache/description/)|[golang](./Algorithm/146.lru缓存机制.go)|Hard

[147 对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list/description/)|[golang](./Algorithm/147.对链表进行插入排序.go)|Medium

[148 排序链表](https://leetcode-cn.com/problems/sort-list/description/)|[golang](./Algorithm/148.排序链表.go)|Medium

[149 直线上最多的点数](https://leetcode-cn.com/problems/max-points-on-a-line/description/)|[golang](./Algorithm/149.直线上最多的点数.go)|Hard

[150 逆波兰表达式求值](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/description/)|[golang](./Algorithm/150.逆波兰表达式求值.go)|Medium

[151 翻转字符串里的单词](https://leetcode-cn.com/problems/reverse-words-in-a-string/description/)|[golang](./Algorithm/151.翻转字符串里的单词.go)|Medium

[152 乘积最大子序列](https://leetcode-cn.com/problems/maximum-product-subarray/description/)|[golang](./Algorithm/152.乘积最大子序列.go)|Medium

[153 寻找旋转排序数组中的最小值](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/description/)|[golang](./Algorithm/153.寻找旋转排序数组中的最小值.go)|Medium

[155 最小栈](https://leetcode-cn.com/problems/min-stack/description/)|[golang](./Algorithm/155.最小栈.go)|Easy

[160 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/description/)|[golang](./Algorithm/160.相交链表.go)|Easy

[162 寻找峰值](https://leetcode-cn.com/problems/find-peak-element/description/)|[golang](./Algorithm/162.寻找峰值.go)|Medium

[165 比较版本号](https://leetcode-cn.com/problems/compare-version-numbers/description/)|[golang](./Algorithm/165.比较版本号.go)|Medium

[167 两数之和-ii-输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/)|[golang](./Algorithm/167.两数之和-ii-输入有序数组.go)|Easy

[168 excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/description/)|[golang](./Algorithm/168.excel表列名称.go)|Easy

[169 求众数](https://leetcode-cn.com/problems/majority-element/description/)|[golang](./Algorithm/169.求众数.go)|Easy

[171 excel表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number/description/)|[golang](./Algorithm/171.excel表列序号.go)|Easy

[172 阶乘后的零](https://leetcode-cn.com/problems/factorial-trailing-zeroes/description/)|[golang](./Algorithm/172.阶乘后的零.go)|Easy

[173 二叉搜索树迭代器](https://leetcode-cn.com/problems/binary-search-tree-iterator/description/)|[golang](./Algorithm/173.二叉搜索树迭代器.go)|Medium

[175 组合两个表](https://leetcode-cn.com/problems/combine-two-tables/description/)|[mysql](./Algorithm/175.组合两个表.sql)|Easy

[176 第二高的薪水](https://leetcode-cn.com/problems/second-highest-salary/description/)|[mysql](./Algorithm/176.第二高的薪水.sql)|Easy

[177 第n高的薪水](https://leetcode-cn.com/problems/nth-highest-salary/description/)|[mysql](./Algorithm/177.第n高的薪水.sql)|Medium

[178 分数排名](https://leetcode-cn.com/problems/rank-scores/description/)|[mysql](./Algorithm/178.分数排名.sql)|Medium

[179 最大数](https://leetcode-cn.com/problems/largest-number/description/)|[golang](./Algorithm/179.最大数.go)|Medium

[181 超过经理收入的员工](https://leetcode-cn.com/problems/employees-earning-more-than-their-managers/description/)|[mysql](./Algorithm/181.超过经理收入的员工.sql)|Easy

[182 查找重复的电子邮箱](https://leetcode-cn.com/problems/duplicate-emails/description/)|[mysql](./Algorithm/182.查找重复的电子邮箱.sql)|Easy

[183 从不订购的客户](https://leetcode-cn.com/problems/customers-who-never-order/description/)|[mysql](./Algorithm/183.从不订购的客户.sql)|Easy

[184 部门工资最高的员工](https://leetcode-cn.com/problems/department-highest-salary/description/)|[mysql](./Algorithm/184.部门工资最高的员工.sql)|Medium

[189 旋转数组](https://leetcode-cn.com/problems/rotate-array/description/)|[golang](./Algorithm/189.旋转数组.go)|Easy

[190 颠倒二进制位](https://leetcode-cn.com/problems/reverse-bits/description/)|[golang](./Algorithm/190.颠倒二进制位.go)|Easy

[191 位-1-的个数](https://leetcode-cn.com/problems/number-of-1-bits/description/)|[golang](./Algorithm/191.位-1-的个数.go)|Easy

[192 统计词频](https://leetcode-cn.com/problems/word-frequency/description/)|[bash](./Algorithm/192.统计词频.sh)|Medium

[193 有效电话号码](https://leetcode-cn.com/problems/valid-phone-numbers/description/)|[bash](./Algorithm/193.有效电话号码.sh)|Easy

[195 第十行](https://leetcode-cn.com/problems/tenth-line/description/)|[bash](./Algorithm/195.第十行.sh)|Easy

[197 上升的温度](https://leetcode-cn.com/problems/rising-temperature/description/)|[mysql](./Algorithm/197.上升的温度.sql)|Easy

[198 打家劫舍](https://leetcode-cn.com/problems/house-robber/description/)|[golang](./Algorithm/198.打家劫舍.go)|Easy

[199 二叉树的右视图](https://leetcode-cn.com/problems/binary-tree-right-side-view/description/)|[golang](./Algorithm/199.二叉树的右视图.go)|Medium

[200 岛屿数量](https://leetcode-cn.com/problems/number-of-islands/description/)|[golang](./Algorithm/200.岛屿数量.go)|Medium

[201 数字范围按位与](https://leetcode-cn.com/problems/bitwise-and-of-numbers-range/description/)|[golang](./Algorithm/201.数字范围按位与.go)|Medium

[202 快乐数](https://leetcode-cn.com/problems/happy-number/description/)|[golang](./Algorithm/202.快乐数.go)|Easy

[203 移除链表元素](https://leetcode-cn.com/problems/remove-linked-list-elements/description/)|[golang](./Algorithm/203.移除链表元素.go)|Easy

[204 计数质数](https://leetcode-cn.com/problems/count-primes/description/)|[golang](./Algorithm/204.计数质数.go)|Easy

[205 同构字符串](https://leetcode-cn.com/problems/isomorphic-strings/description/)|[golang](./Algorithm/205.同构字符串.go)|Easy

[206 reverse-linked-list](https://leetcode.com/problems/reverse-linked-list/description/)|[csharp](./Algorithm/206.reverse-linked-list.cs)|Easy

[206 反转链表](https://leetcode-cn.com/problems/reverse-linked-list/description/)|[golang](./Algorithm/206.反转链表.go)|Easy

[207 课程表](https://leetcode-cn.com/problems/course-schedule/description/)|[golang](./Algorithm/207.课程表.go)|Medium

[208 实现-trie-前缀树](https://leetcode-cn.com/problems/implement-trie-prefix-tree/description/)|[golang](./Algorithm/208.实现-trie-前缀树.go)|Medium

[209 长度最小的子数组](https://leetcode-cn.com/problems/minimum-size-subarray-sum/description/)|[golang](./Algorithm/209.长度最小的子数组.go)|Medium

[210 课程表-ii](https://leetcode-cn.com/problems/course-schedule-ii/description/)|[golang](./Algorithm/210.课程表-ii.go)|Medium

[211 添加与搜索单词-数据结构设计](https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/description/)|[golang](./Algorithm/211.添加与搜索单词-数据结构设计.go)|Medium

[212 单词搜索-ii](https://leetcode-cn.com/problems/word-search-ii/description/)|[golang](./Algorithm/212.单词搜索-ii.go)|Hard

[213 打家劫舍-ii](https://leetcode-cn.com/problems/house-robber-ii/description/)|[golang](./Algorithm/213.打家劫舍-ii.go)|Medium

[215 数组中的第k个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/description/)|[golang](./Algorithm/215.数组中的第k个最大元素.go)|Medium

[216 组合总和-iii](https://leetcode-cn.com/problems/combination-sum-iii/description/)|[golang](./Algorithm/216.组合总和-iii.go)|Medium

[217 contains-duplicate](https://leetcode.com/problems/contains-duplicate/description/)|[csharp](./Algorithm/217.contains-duplicate.cs)|Easy

[217 存在重复元素](https://leetcode-cn.com/problems/contains-duplicate/description/)|[golang](./Algorithm/217.存在重复元素.go)|Easy

[219 存在重复元素-ii](https://leetcode-cn.com/problems/contains-duplicate-ii/description/)|[golang](./Algorithm/219.存在重复元素-ii.go)|Easy

[221 最大正方形](https://leetcode-cn.com/problems/maximal-square/description/)|[golang](./Algorithm/221.最大正方形.go)|Medium

[222 完全二叉树的节点个数](https://leetcode-cn.com/problems/count-complete-tree-nodes/description/)|[golang](./Algorithm/222.完全二叉树的节点个数.go)|Medium

[223 矩形面积](https://leetcode-cn.com/problems/rectangle-area/description/)|[golang](./Algorithm/223.矩形面积.go)|Medium

[224 基本计算器](https://leetcode-cn.com/problems/basic-calculator/description/)|[golang](./Algorithm/224.基本计算器.go)|Hard

[225 用队列实现栈](https://leetcode-cn.com/problems/implement-stack-using-queues/description/)|[golang](./Algorithm/225.用队列实现栈.go)|Easy

[226 invert-binary-tree](https://leetcode.com/problems/invert-binary-tree/description/)|[csharp](./Algorithm/226.invert-binary-tree.cs)|Easy

[226 翻转二叉树](https://leetcode-cn.com/problems/invert-binary-tree/description/)|[golang](./Algorithm/226.翻转二叉树.go)|Easy

[227 基本计算器-ii](https://leetcode-cn.com/problems/basic-calculator-ii/description/)|[golang](./Algorithm/227.基本计算器-ii.go)|Medium

[228 汇总区间](https://leetcode-cn.com/problems/summary-ranges/description/)|[golang](./Algorithm/228.汇总区间.go)|Medium

[229 求众数-ii](https://leetcode-cn.com/problems/majority-element-ii/description/)|[golang](./Algorithm/229.求众数-ii.go)|Medium

[230 二叉搜索树中第k小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/description/)|[golang](./Algorithm/230.二叉搜索树中第k小的元素.go)|Medium

[231 2-的幂](https://leetcode-cn.com/problems/power-of-two/description/)|[golang](./Algorithm/231.2-的幂.go)|Easy

[232 用栈实现队列](https://leetcode-cn.com/problems/implement-queue-using-stacks/description/)|[golang](./Algorithm/232.用栈实现队列.go)|Easy

[234 回文链表](https://leetcode-cn.com/problems/palindrome-linked-list/description/)|[golang](./Algorithm/234.回文链表.go)|Easy

[235 二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/)|[golang](./Algorithm/235.二叉搜索树的最近公共祖先.go)|Easy

[236 二叉树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/description/)|[golang](./Algorithm/236.二叉树的最近公共祖先.go)|Medium

[237 删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/description/)|[golang](./Algorithm/237.删除链表中的节点.go)|Easy

[238 除自身以外数组的乘积](https://leetcode-cn.com/problems/product-of-array-except-self/description/)|[golang](./Algorithm/238.除自身以外数组的乘积.go)|Medium

[239 滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum/description/)|[golang](./Algorithm/239.滑动窗口最大值.go)|Hard

[240 搜索二维矩阵-ii](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/description/)|[golang](./Algorithm/240.搜索二维矩阵-ii.go)|Medium

[241 为运算表达式设计优先级](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/description/)|[golang](./Algorithm/241.为运算表达式设计优先级.go)|Medium

[242 有效的字母异位词](https://leetcode-cn.com/problems/valid-anagram/description/)|[golang](./Algorithm/242.有效的字母异位词.go)|Easy

[257 二叉树的所有路径](https://leetcode-cn.com/problems/binary-tree-paths/description/)|[golang](./Algorithm/257.二叉树的所有路径.go)|Easy

[258 各位相加](https://leetcode-cn.com/problems/add-digits/description/)|[golang](./Algorithm/258.各位相加.go)|Easy

[260 只出现一次的数字-iii](https://leetcode-cn.com/problems/single-number-iii/description/)|[golang](./Algorithm/260.只出现一次的数字-iii.go)|Medium

[263 丑数](https://leetcode-cn.com/problems/ugly-number/description/)|[golang](./Algorithm/263.丑数.go)|Easy

[264 丑数-ii](https://leetcode-cn.com/problems/ugly-number-ii/description/)|[golang](./Algorithm/264.丑数-ii.go)|Medium

[268 缺失数字](https://leetcode-cn.com/problems/missing-number/description/)|[golang](./Algorithm/268.缺失数字.go)|Easy

[278 第一个错误的版本](https://leetcode-cn.com/problems/first-bad-version/description/)|[python](./Algorithm/278.第一个错误的版本.py)|Easy

[279 完全平方数](https://leetcode-cn.com/problems/perfect-squares/description/)|[golang](./Algorithm/279.完全平方数.go)|Medium

[283 移动零](https://leetcode-cn.com/problems/move-zeroes/description/)|[golang](./Algorithm/283.移动零.go)|Easy

[284 顶端迭代器](https://leetcode-cn.com/problems/peeking-iterator/description/)|[python](./Algorithm/284.顶端迭代器.py)|Medium

[287 寻找重复数](https://leetcode-cn.com/problems/find-the-duplicate-number/description/)|[golang](./Algorithm/287.寻找重复数.go)|Medium

[289 生命游戏](https://leetcode-cn.com/problems/game-of-life/description/)|[golang](./Algorithm/289.生命游戏.go)|Medium

[290 单词规律](https://leetcode-cn.com/problems/word-pattern/description/)|[golang](./Algorithm/290.单词规律.go)|Easy

[292 nim-游戏](https://leetcode-cn.com/problems/nim-game/description/)|[golang](./Algorithm/292.nim-游戏.go)|Easy

[295 数据流的中位数](https://leetcode-cn.com/problems/find-median-from-data-stream/description/)|[golang](./Algorithm/295.数据流的中位数.go)|Hard

[297 二叉树的序列化与反序列化](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/description/)|[python](./Algorithm/297.二叉树的序列化与反序列化.py)|Hard

[300 最长上升子序列](https://leetcode-cn.com/problems/longest-increasing-subsequence/description/)|[golang](./Algorithm/300.最长上升子序列.go)|Medium

[301 删除无效的括号](https://leetcode-cn.com/problems/remove-invalid-parentheses/description/)|[golang](./Algorithm/301.删除无效的括号.go)|Hard

[303 区域和检索-数组不可变](https://leetcode-cn.com/problems/range-sum-query-immutable/description/)|[golang](./Algorithm/303.区域和检索-数组不可变.go)|Easy

[304 二维区域和检索-矩阵不可变](https://leetcode-cn.com/problems/range-sum-query-2d-immutable/description/)|[golang](./Algorithm/304.二维区域和检索-矩阵不可变.go)|Medium

[307 区域和检索-数组可修改](https://leetcode-cn.com/problems/range-sum-query-mutable/description/)|[golang](./Algorithm/307.区域和检索-数组可修改.go)|Medium

[309 最佳买卖股票时机含冷冻期](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)|[golang](./Algorithm/309.最佳买卖股票时机含冷冻期.go)|Medium

[310 最小高度树](https://leetcode-cn.com/problems/minimum-height-trees/description/)|[golang](./Algorithm/310.最小高度树.go)|Medium

[313 超级丑数](https://leetcode-cn.com/problems/super-ugly-number/description/)|[golang](./Algorithm/313.超级丑数.go)|Medium

[318 最大单词长度乘积](https://leetcode-cn.com/problems/maximum-product-of-word-lengths/description/)|[golang](./Algorithm/318.最大单词长度乘积.go)|Medium

[319 灯泡开关](https://leetcode-cn.com/problems/bulb-switcher/description/)|[golang](./Algorithm/319.灯泡开关.go)|Medium

[322 零钱兑换](https://leetcode-cn.com/problems/coin-change/description/)|[golang](./Algorithm/322.零钱兑换.go)|Medium

[324 摆动排序-ii](https://leetcode-cn.com/problems/wiggle-sort-ii/description/)|[golang](./Algorithm/324.摆动排序-ii.go)|Medium

[326 3-的幂](https://leetcode-cn.com/problems/power-of-three/description/)|[golang](./Algorithm/326.3-的幂.go)|Easy

[328 奇偶链表](https://leetcode-cn.com/problems/odd-even-linked-list/description/)|[golang](./Algorithm/328.奇偶链表.go)|Medium

[329 矩阵中的最长递增路径](https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/description/)|[golang](./Algorithm/329.矩阵中的最长递增路径.go)|Hard

[331 验证二叉树的前序序列化](https://leetcode-cn.com/problems/verify-preorder-serialization-of-a-binary-tree/description/)|[golang](./Algorithm/331.验证二叉树的前序序列化.go)|Medium

[332 重新安排行程](https://leetcode-cn.com/problems/reconstruct-itinerary/description/)|[golang](./Algorithm/332.重新安排行程.go)|Medium

[334 递增的三元子序列](https://leetcode-cn.com/problems/increasing-triplet-subsequence/description/)|[golang](./Algorithm/334.递增的三元子序列.go)|Medium

[337 打家劫舍-iii](https://leetcode-cn.com/problems/house-robber-iii/description/)|[golang](./Algorithm/337.打家劫舍-iii.go)|Medium

[338 比特位计数](https://leetcode-cn.com/problems/counting-bits/description/)|[golang](./Algorithm/338.比特位计数.go)|Medium

[342 4-的幂](https://leetcode-cn.com/problems/power-of-four/description/)|[golang](./Algorithm/342.4-的幂.go)|Easy

[343 整数拆分](https://leetcode-cn.com/problems/integer-break/description/)|[golang](./Algorithm/343.整数拆分.go)|Medium

[344 反转字符串](https://leetcode-cn.com/problems/reverse-string/description/)|[golang](./Algorithm/344.反转字符串.go)|Easy

[345 反转字符串中的元音字母](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)|[golang](./Algorithm/345.反转字符串中的元音字母.go)|Easy

[347 前k个高频元素](https://leetcode-cn.com/problems/top-k-frequent-elements/description/)|[golang](./Algorithm/347.前k个高频元素.go)|Medium

[349 两个数组的交集](https://leetcode-cn.com/problems/intersection-of-two-arrays/description/)|[golang](./Algorithm/349.两个数组的交集.go)|Easy

[350 两个数组的交集-ii](https://leetcode-cn.com/problems/intersection-of-two-arrays-ii/description/)|[golang](./Algorithm/350.两个数组的交集-ii.go)|Easy

[354 俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/description/)|[golang](./Algorithm/354.俄罗斯套娃信封问题.go)|Hard

[355 设计推特](https://leetcode-cn.com/problems/design-twitter/description/)|[golang](./Algorithm/355.设计推特.go)|Medium

[357 计算各个位数不同的数字个数](https://leetcode-cn.com/problems/count-numbers-with-unique-digits/description/)|[golang](./Algorithm/357.计算各个位数不同的数字个数.go)|Medium

[365 水壶问题](https://leetcode-cn.com/problems/water-and-jug-problem/description/)|[csharp](./Algorithm/365.水壶问题.cs)|Medium

[367 有效的完全平方数](https://leetcode-cn.com/problems/valid-perfect-square/description/)|[golang](./Algorithm/367.有效的完全平方数.go)|Easy

[368 最大整除子集](https://leetcode-cn.com/problems/largest-divisible-subset/description/)|[golang](./Algorithm/368.最大整除子集.go)|Medium

[371 两整数之和](https://leetcode-cn.com/problems/sum-of-two-integers/description/)|[golang](./Algorithm/371.两整数之和.go)|Easy

[373 查找和最小的k对数字](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/description/)|[golang](./Algorithm/373.查找和最小的k对数字.go)|Medium

[374 猜数字大小](https://leetcode-cn.com/problems/guess-number-higher-or-lower/description/)|[csharp](./Algorithm/374.猜数字大小.cs)|Easy

[374 猜数字大小](https://leetcode-cn.com/problems/guess-number-higher-or-lower/description/)|[python](./Algorithm/374.猜数字大小.py)|Easy

[375 猜数字大小-ii](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/description/)|[golang](./Algorithm/375.猜数字大小-ii.go)|Medium

[376 摆动序列](https://leetcode-cn.com/problems/wiggle-subsequence/description/)|[golang](./Algorithm/376.摆动序列.go)|Medium

[377 组合总和-ⅳ](https://leetcode-cn.com/problems/combination-sum-iv/description/)|[golang](./Algorithm/377.组合总和-ⅳ.go)|Medium

[378 有序矩阵中第k小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/description/)|[golang](./Algorithm/378.有序矩阵中第k小的元素.go)|Medium

[380 常数时间插入、删除和获取随机元素](https://leetcode-cn.com/problems/insert-delete-getrandom-o1/description/)|[golang](./Algorithm/380.常数时间插入、删除和获取随机元素.go)|Medium

[381 o-1-时间插入、删除和获取随机元素-允许重复](https://leetcode-cn.com/problems/insert-delete-getrandom-o1-duplicates-allowed/description/)|[golang](./Algorithm/381.o-1-时间插入、删除和获取随机元素-允许重复.go)|Hard

[382 链表随机节点](https://leetcode-cn.com/problems/linked-list-random-node/description/)|[golang](./Algorithm/382.链表随机节点.go)|Medium

[383 赎金信](https://leetcode-cn.com/problems/ransom-note/description/)|[golang](./Algorithm/383.赎金信.go)|Easy

[384 打乱数组](https://leetcode-cn.com/problems/shuffle-an-array/description/)|[golang](./Algorithm/384.打乱数组.go)|Medium

[385 迷你语法分析器](https://leetcode-cn.com/problems/mini-parser/description/)|[csharp](./Algorithm/385.迷你语法分析器.cs)|Medium

[385 迷你语法分析器](https://leetcode-cn.com/problems/mini-parser/description/)|[golang](./Algorithm/385.迷你语法分析器.go)|Medium

[386 字典序排数](https://leetcode-cn.com/problems/lexicographical-numbers/description/)|[golang](./Algorithm/386.字典序排数.go)|Medium

[387 字符串中的第一个唯一字符](https://leetcode-cn.com/problems/first-unique-character-in-a-string/description/)|[golang](./Algorithm/387.字符串中的第一个唯一字符.go)|Easy

[388 文件的最长绝对路径](https://leetcode-cn.com/problems/longest-absolute-file-path/description/)|[golang](./Algorithm/388.文件的最长绝对路径.go)|Medium

[389 找不同](https://leetcode-cn.com/problems/find-the-difference/description/)|[golang](./Algorithm/389.找不同.go)|Easy

[390 消除游戏](https://leetcode-cn.com/problems/elimination-game/description/)|[golang](./Algorithm/390.消除游戏.go)|Medium

[392 判断子序列](https://leetcode-cn.com/problems/is-subsequence/description/)|[golang](./Algorithm/392.判断子序列.go)|Medium

[393 utf-8-编码验证](https://leetcode-cn.com/problems/utf-8-validation/description/)|[golang](./Algorithm/393.utf-8-编码验证.go)|Medium

[394 字符串解码](https://leetcode-cn.com/problems/decode-string/description/)|[golang](./Algorithm/394.字符串解码.go)|Medium

[396 旋转函数](https://leetcode-cn.com/problems/rotate-function/description/)|[golang](./Algorithm/396.旋转函数.go)|Medium

[397 整数替换](https://leetcode-cn.com/problems/integer-replacement/description/)|[golang](./Algorithm/397.整数替换.go)|Medium

[398 随机数索引](https://leetcode-cn.com/problems/random-pick-index/description/)|[golang](./Algorithm/398.随机数索引.go)|Medium

[400 第n个数字](https://leetcode-cn.com/problems/nth-digit/description/)|[golang](./Algorithm/400.第n个数字.go)|Easy

[401 二进制手表](https://leetcode-cn.com/problems/binary-watch/description/)|[golang](./Algorithm/401.二进制手表.go)|Easy

[404 左叶子之和](https://leetcode-cn.com/problems/sum-of-left-leaves/description/)|[golang](./Algorithm/404.左叶子之和.go)|Easy

[405 数字转换为十六进制数](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/description/)|[golang](./Algorithm/405.数字转换为十六进制数.go)|Easy

[406 根据身高重建队列](https://leetcode-cn.com/problems/queue-reconstruction-by-height/description/)|[csharp](./Algorithm/406.根据身高重建队列.cs)|Medium

[409 最长回文串](https://leetcode-cn.com/problems/longest-palindrome/description/)|[golang](./Algorithm/409.最长回文串.go)|Easy

[412 fizz-buzz](https://leetcode-cn.com/problems/fizz-buzz/description/)|[golang](./Algorithm/412.fizz-buzz.go)|Easy

[414 第三大的数](https://leetcode-cn.com/problems/third-maximum-number/description/)|[golang](./Algorithm/414.第三大的数.go)|Easy

[415 字符串相加](https://leetcode-cn.com/problems/add-strings/description/)|[golang](./Algorithm/415.字符串相加.go)|Easy

[416 分割等和子集](https://leetcode-cn.com/problems/partition-equal-subset-sum/description/)|[golang](./Algorithm/416.分割等和子集.go)|Medium

[417 太平洋大西洋水流问题](https://leetcode-cn.com/problems/pacific-atlantic-water-flow/description/)|[golang](./Algorithm/417.太平洋大西洋水流问题.go)|Medium

[421 数组中两个数的最大异或值](https://leetcode-cn.com/problems/maximum-xor-of-two-numbers-in-an-array/description/)|[golang](./Algorithm/421.数组中两个数的最大异或值.go)|Medium

[427 建立四叉树](https://leetcode-cn.com/problems/construct-quad-tree/description/)|[python](./Algorithm/427.建立四叉树.py)|Easy

[429 n叉树的层序遍历](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/description/)|[python](./Algorithm/429.n叉树的层序遍历.py)|Easy

[430 扁平化多级双向链表](https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list/description/)|[csharp](./Algorithm/430.扁平化多级双向链表.cs)|Medium

[432 全-o-1-的数据结构](https://leetcode-cn.com/problems/all-oone-data-structure/description/)|[golang](./Algorithm/432.全-o-1-的数据结构.go)|Hard

[434 字符串中的单词数](https://leetcode-cn.com/problems/number-of-segments-in-a-string/description/)|[golang](./Algorithm/434.字符串中的单词数.go)|Easy

[435 无重叠区间](https://leetcode-cn.com/problems/non-overlapping-intervals/description/)|[golang](./Algorithm/435.无重叠区间.go)|Medium

[437 路径总和-iii](https://leetcode-cn.com/problems/path-sum-iii/description/)|[golang](./Algorithm/437.路径总和-iii.go)|Easy

[438 找到字符串中所有字母异位词](https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/description/)|[golang](./Algorithm/438.找到字符串中所有字母异位词.go)|Easy

[441 排列硬币](https://leetcode-cn.com/problems/arranging-coins/description/)|[golang](./Algorithm/441.排列硬币.go)|Easy

[442 数组中重复的数据](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/description/)|[golang](./Algorithm/442.数组中重复的数据.go)|Medium

[443 压缩字符串](https://leetcode-cn.com/problems/string-compression/description/)|[golang](./Algorithm/443.压缩字符串.go)|Easy

[445 两数相加-ii](https://leetcode-cn.com/problems/add-two-numbers-ii/description/)|[golang](./Algorithm/445.两数相加-ii.go)|Medium

[448 找到所有数组中消失的数字](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/description/)|[golang](./Algorithm/448.找到所有数组中消失的数字.go)|Easy

[450 删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/description/)|[golang](./Algorithm/450.删除二叉搜索树中的节点.go)|Medium

[451 根据字符出现频率排序](https://leetcode-cn.com/problems/sort-characters-by-frequency/description/)|[golang](./Algorithm/451.根据字符出现频率排序.go)|Medium

[453 最小操作次数使数组元素相等](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements/description/)|[csharp](./Algorithm/453.最小操作次数使数组元素相等.cs)|Easy

[454 四数相加-ii](https://leetcode-cn.com/problems/4sum-ii/description/)|[golang](./Algorithm/454.四数相加-ii.go)|Medium

[459 重复的子字符串](https://leetcode-cn.com/problems/repeated-substring-pattern/description/)|[golang](./Algorithm/459.重复的子字符串.go)|Easy

[461 汉明距离](https://leetcode-cn.com/problems/hamming-distance/description/)|[golang](./Algorithm/461.汉明距离.go)|Easy

[462 最少移动次数使数组元素相等-ii](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii/description/)|[golang](./Algorithm/462.最少移动次数使数组元素相等-ii.go)|Medium

[463 岛屿的周长](https://leetcode-cn.com/problems/island-perimeter/description/)|[csharp](./Algorithm/463.岛屿的周长.cs)|Easy

[470 用-rand-7-实现-rand-10](https://leetcode-cn.com/problems/implement-rand10-using-rand7/description/)|[golang](./Algorithm/470.用-rand-7-实现-rand-10.go)|Medium

[474 一和零](https://leetcode-cn.com/problems/ones-and-zeroes/description/)|[golang](./Algorithm/474.一和零.go)|Medium

[476 数字的补数](https://leetcode-cn.com/problems/number-complement/description/)|[golang](./Algorithm/476.数字的补数.go)|Easy

[477 汉明距离总和](https://leetcode-cn.com/problems/total-hamming-distance/description/)|[golang](./Algorithm/477.汉明距离总和.go)|Medium

[478 在圆内随机生成点](https://leetcode-cn.com/problems/generate-random-point-in-a-circle/description/)|[golang](./Algorithm/478.在圆内随机生成点.go)|Medium

[481 神奇字符串](https://leetcode-cn.com/problems/magical-string/description/)|[csharp](./Algorithm/481.神奇字符串.cs)|Medium

[485 最大连续-1-的个数](https://leetcode-cn.com/problems/max-consecutive-ones/description/)|[golang](./Algorithm/485.最大连续-1-的个数.go)|Easy

[491 递增子序列](https://leetcode-cn.com/problems/increasing-subsequences/description/)|[golang](./Algorithm/491.递增子序列.go)|Medium

[492 构造矩形](https://leetcode-cn.com/problems/construct-the-rectangle/description/)|[csharp](./Algorithm/492.构造矩形.cs)|Easy

[494 目标和](https://leetcode-cn.com/problems/target-sum/description/)|[golang](./Algorithm/494.目标和.go)|Medium

[498 对角线遍历](https://leetcode-cn.com/problems/diagonal-traverse/description/)|[golang](./Algorithm/498.对角线遍历.go)|Medium

[500 键盘行](https://leetcode-cn.com/problems/keyboard-row/description/)|[golang](./Algorithm/500.键盘行.go)|Easy

[504 七进制数](https://leetcode-cn.com/problems/base-7/description/)|[csharp](./Algorithm/504.七进制数.cs)|Easy

[507 完美数](https://leetcode-cn.com/problems/perfect-number/description/)|[golang](./Algorithm/507.完美数.go)|Easy

[508 出现次数最多的子树元素和](https://leetcode-cn.com/problems/most-frequent-subtree-sum/description/)|[csharp](./Algorithm/508.出现次数最多的子树元素和.cs)|Medium

[509 斐波那契数](https://leetcode-cn.com/problems/fibonacci-number/description/)|[golang](./Algorithm/509.斐波那契数.go)|Easy

[513 找树左下角的值](https://leetcode-cn.com/problems/find-bottom-left-tree-value/description/)|[golang](./Algorithm/513.找树左下角的值.go)|Medium

[515 在每个树行中找最大值](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/description/)|[golang](./Algorithm/515.在每个树行中找最大值.go)|Medium

[518 零钱兑换-ii](https://leetcode-cn.com/problems/coin-change-2/description/)|[golang](./Algorithm/518.零钱兑换-ii.go)|Medium

[520 检测大写字母](https://leetcode-cn.com/problems/detect-capital/description/)|[csharp](./Algorithm/520.检测大写字母.cs)|Easy

[523 连续的子数组和](https://leetcode-cn.com/problems/continuous-subarray-sum/description/)|[golang](./Algorithm/523.连续的子数组和.go)|Medium

[526 优美的排列](https://leetcode-cn.com/problems/beautiful-arrangement/description/)|[golang](./Algorithm/526.优美的排列.go)|Medium

[529 扫雷游戏](https://leetcode-cn.com/problems/minesweeper/description/)|[csharp](./Algorithm/529.扫雷游戏.cs)|Medium

[530 二叉搜索树的最小绝对差](https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/description/)|[golang](./Algorithm/530.二叉搜索树的最小绝对差.go)|Easy

[537 复数乘法](https://leetcode-cn.com/problems/complex-number-multiplication/description/)|[golang](./Algorithm/537.复数乘法.go)|Medium

[538 把二叉搜索树转换为累加树](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/description/)|[golang](./Algorithm/538.把二叉搜索树转换为累加树.go)|Easy

[539 最小时间差](https://leetcode-cn.com/problems/minimum-time-difference/description/)|[golang](./Algorithm/539.最小时间差.go)|Medium

[540 有序数组中的单一元素](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/description/)|[golang](./Algorithm/540.有序数组中的单一元素.go)|Medium

[542 01-矩阵](https://leetcode-cn.com/problems/01-matrix/description/)|[golang](./Algorithm/542.01-矩阵.go)|Medium

[543 二叉树的直径](https://leetcode-cn.com/problems/diameter-of-binary-tree/description/)|[golang](./Algorithm/543.二叉树的直径.go)|Easy

[547 朋友圈](https://leetcode-cn.com/problems/friend-circles/description/)|[golang](./Algorithm/547.朋友圈.go)|Medium

[553 最优除法](https://leetcode-cn.com/problems/optimal-division/description/)|[csharp](./Algorithm/553.最优除法.cs)|Medium

[557 反转字符串中的单词-iii](https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/description/)|[csharp](./Algorithm/557.反转字符串中的单词-iii.cs)|Easy

[559 n叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/description/)|[python](./Algorithm/559.n叉树的最大深度.py)|Easy

[560 和为k的子数组](https://leetcode-cn.com/problems/subarray-sum-equals-k/description/)|[csharp](./Algorithm/560.和为k的子数组.cs)|Medium

[561 数组拆分-i](https://leetcode-cn.com/problems/array-partition-i/description/)|[csharp](./Algorithm/561.数组拆分-i.cs)|Easy

[563 二叉树的坡度](https://leetcode-cn.com/problems/binary-tree-tilt/description/)|[golang](./Algorithm/563.二叉树的坡度.go)|Easy

[566 重塑矩阵](https://leetcode-cn.com/problems/reshape-the-matrix/description/)|[csharp](./Algorithm/566.重塑矩阵.cs)|Easy

[567 字符串的排列](https://leetcode-cn.com/problems/permutation-in-string/description/)|[golang](./Algorithm/567.字符串的排列.go)|Medium

[572 另一棵树的子树](https://leetcode-cn.com/problems/subtree-of-another-tree/description/)|[csharp](./Algorithm/572.另一棵树的子树.cs)|Easy

[575 分糖果](https://leetcode-cn.com/problems/distribute-candies/description/)|[csharp](./Algorithm/575.分糖果.cs)|Easy

[576 出界的路径数](https://leetcode-cn.com/problems/out-of-boundary-paths/description/)|[golang](./Algorithm/576.出界的路径数.go)|Medium

[583 两个字符串的删除操作](https://leetcode-cn.com/problems/delete-operation-for-two-strings/description/)|[golang](./Algorithm/583.两个字符串的删除操作.go)|Medium

[589 n叉树的前序遍历](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/description/)|[python](./Algorithm/589.n叉树的前序遍历.py)|Easy

[590 n叉树的后序遍历](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/description/)|[python](./Algorithm/590.n叉树的后序遍历.py)|Easy

[594 最长和谐子序列](https://leetcode-cn.com/problems/longest-harmonious-subsequence/description/)|[csharp](./Algorithm/594.最长和谐子序列.cs)|Easy

[595 大的国家](https://leetcode-cn.com/problems/big-countries/description/)|[mysql](./Algorithm/595.大的国家.sql)|Easy

[596 超过-5-名学生的课](https://leetcode-cn.com/problems/classes-more-than-5-students/description/)|[mysql](./Algorithm/596.超过-5-名学生的课.sql)|Easy

[598 范围求和-ii](https://leetcode-cn.com/problems/range-addition-ii/description/)|[csharp](./Algorithm/598.范围求和-ii.cs)|Easy

[606 根据二叉树创建字符串](https://leetcode-cn.com/problems/construct-string-from-binary-tree/description/)|[csharp](./Algorithm/606.根据二叉树创建字符串.cs)|Easy

[617 合并二叉树](https://leetcode-cn.com/problems/merge-two-binary-trees/description/)|[csharp](./Algorithm/617.合并二叉树.cs)|Easy

[620 有趣的电影](https://leetcode-cn.com/problems/not-boring-movies/description/)|[mysql](./Algorithm/620.有趣的电影.sql)|Easy

[623 在二叉树中增加一行](https://leetcode-cn.com/problems/add-one-row-to-tree/description/)|[csharp](./Algorithm/623.在二叉树中增加一行.cs)|Medium

[633 平方数之和](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)|[csharp](./Algorithm/633.平方数之和.cs)|Medium

[640 求解方程](https://leetcode-cn.com/problems/solve-the-equation/description/)|[csharp](./Algorithm/640.求解方程.cs)|Medium

[641 设计循环双端队列](https://leetcode-cn.com/problems/design-circular-deque/description/)|[csharp](./Algorithm/641.设计循环双端队列.cs)|Medium

[646 最长数对链](https://leetcode-cn.com/problems/maximum-length-of-pair-chain/description/)|[golang](./Algorithm/646.最长数对链.go)|Medium

[647 回文子串](https://leetcode-cn.com/problems/palindromic-substrings/description/)|[golang](./Algorithm/647.回文子串.go)|Medium

[648 单词替换](https://leetcode-cn.com/problems/replace-words/description/)|[golang](./Algorithm/648.单词替换.go)|Medium

[650 只有两个键的键盘](https://leetcode-cn.com/problems/2-keys-keyboard/description/)|[csharp](./Algorithm/650.只有两个键的键盘.cs)|Medium

[654 最大二叉树](https://leetcode-cn.com/problems/maximum-binary-tree/description/)|[golang](./Algorithm/654.最大二叉树.go)|Medium

[655 输出二叉树](https://leetcode-cn.com/problems/print-binary-tree/description/)|[golang](./Algorithm/655.输出二叉树.go)|Medium

[662 二叉树最大宽度](https://leetcode-cn.com/problems/maximum-width-of-binary-tree/description/)|[golang](./Algorithm/662.二叉树最大宽度.go)|Medium

[670 最大交换](https://leetcode-cn.com/problems/maximum-swap/description/)|[golang](./Algorithm/670.最大交换.go)|Medium

[671 二叉树中第二小的节点](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/description/)|[golang](./Algorithm/671.二叉树中第二小的节点.go)|Easy

[673 最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/description/)|[golang](./Algorithm/673.最长递增子序列的个数.go)|Medium

[674 最长连续递增序列](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/description/)|[golang](./Algorithm/674.最长连续递增序列.go)|Easy

[676 实现一个魔法字典](https://leetcode-cn.com/problems/implement-magic-dictionary/description/)|[csharp](./Algorithm/676.实现一个魔法字典.cs)|Medium

[676 实现一个魔法字典](https://leetcode-cn.com/problems/implement-magic-dictionary/description/)|[golang](./Algorithm/676.实现一个魔法字典.go)|Medium

[677 键值映射](https://leetcode-cn.com/problems/map-sum-pairs/description/)|[golang](./Algorithm/677.键值映射.go)|Medium

[688 马-在棋盘上的概率](https://leetcode-cn.com/problems/knight-probability-in-chessboard/description/)|[golang](./Algorithm/688.马-在棋盘上的概率.go)|Medium

[690 员工的重要性](https://leetcode-cn.com/problems/employee-importance/description/)|[python](./Algorithm/690.员工的重要性.py)|Easy

[692 前k个高频单词](https://leetcode-cn.com/problems/top-k-frequent-words/description/)|[golang](./Algorithm/692.前k个高频单词.go)|Medium

[693 交替位二进制数](https://leetcode-cn.com/problems/binary-number-with-alternating-bits/description/)|[golang](./Algorithm/693.交替位二进制数.go)|Easy

[695 岛屿的最大面积](https://leetcode-cn.com/problems/max-area-of-island/description/)|[golang](./Algorithm/695.岛屿的最大面积.go)|Medium

[700 二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/description/)|[csharp](./Algorithm/700.二叉搜索树中的搜索.cs)|Easy

[701 二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/description/)|[golang](./Algorithm/701.二叉搜索树中的插入操作.go)|Medium

[703 数据流中的第k大元素](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/description/)|[csharp](./Algorithm/703.数据流中的第k大元素.cs)|Easy

[704 二分查找](https://leetcode-cn.com/problems/binary-search/description/)|[csharp](./Algorithm/704.二分查找.cs)|Easy

[712 两个字符串的最小ascii删除和](https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings/description/)|[golang](./Algorithm/712.两个字符串的最小ascii删除和.go)|Medium

[713 乘积小于k的子数组](https://leetcode-cn.com/problems/subarray-product-less-than-k/description/)|[golang](./Algorithm/713.乘积小于k的子数组.go)|Medium

[714 买卖股票的最佳时机含手续费](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)|[golang](./Algorithm/714.买卖股票的最佳时机含手续费.go)|Medium

[718 最长重复子数组](https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/description/)|[golang](./Algorithm/718.最长重复子数组.go)|Medium

[720 词典中最长的单词](https://leetcode-cn.com/problems/longest-word-in-dictionary/description/)|[golang](./Algorithm/720.词典中最长的单词.go)|Easy

[722 删除注释](https://leetcode-cn.com/problems/remove-comments/description/)|[golang](./Algorithm/722.删除注释.go)|Medium

[724 寻找数组的中心索引](https://leetcode-cn.com/problems/find-pivot-index/description/)|[golang](./Algorithm/724.寻找数组的中心索引.go)|Easy

[725 分隔链表](https://leetcode-cn.com/problems/split-linked-list-in-parts/description/)|[csharp](./Algorithm/725.分隔链表.cs)|Medium

[739 每日温度](https://leetcode-cn.com/problems/daily-temperatures/description/)|[golang](./Algorithm/739.每日温度.go)|Medium

[740 删除与获得点数](https://leetcode-cn.com/problems/delete-and-earn/description/)|[golang](./Algorithm/740.删除与获得点数.go)|Medium

[743 网络延迟时间](https://leetcode-cn.com/problems/network-delay-time/description/)|[golang](./Algorithm/743.网络延迟时间.go)|Medium

[746 使用最小花费爬楼梯](https://leetcode-cn.com/problems/min-cost-climbing-stairs/description/)|[golang](./Algorithm/746.使用最小花费爬楼梯.go)|Easy

[766 托普利茨矩阵](https://leetcode-cn.com/problems/toeplitz-matrix/description/)|[golang](./Algorithm/766.托普利茨矩阵.go)|Easy

[819 最常见的单词](https://leetcode-cn.com/problems/most-common-word/description/)|[csharp](./Algorithm/819.最常见的单词.cs)|Easy

[821 字符的最短距离](https://leetcode-cn.com/problems/shortest-distance-to-a-character/description/)|[csharp](./Algorithm/821.字符的最短距离.cs)|Easy

[824 山羊拉丁文](https://leetcode-cn.com/problems/goat-latin/description/)|[csharp](./Algorithm/824.山羊拉丁文.cs)|Easy

[832 翻转图像](https://leetcode-cn.com/problems/flipping-an-image/description/)|[golang](./Algorithm/832.翻转图像.go)|Easy

[836 矩形重叠](https://leetcode-cn.com/problems/rectangle-overlap/description/)|[csharp](./Algorithm/836.矩形重叠.cs)|Easy

[965 单值二叉树](https://leetcode-cn.com/problems/univalued-binary-tree/description/)|[golang](./Algorithm/965.单值二叉树.go)|Easy