# LeetCode

**Repository Path**: kivenc/LeetCode

## Basic Information

- **Project Name**: LeetCode
- **Description**: Solution for LeetCode problems.
- **Primary Language**: Python
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-05-04
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


| [English](README_EN.md) | 简体中文 |

<p align="center"><img width="300" src="https://raw.githubusercontent.com/KivenCkl/LeetCode_Helper/master/imgs/leetcode-logo.png"></p>
<p align="center">
    <img src="https://img.shields.io/badge/用户-KivenC-blue.svg?" alt="">
    <img src="https://img.shields.io/badge/已解决-212/1566-blue.svg?" alt="">
    <img src="https://img.shields.io/badge/简单-88-green.svg?" alt="">
    <img src="https://img.shields.io/badge/中等-112-orange.svg?" alt="">
    <img src="https://img.shields.io/badge/困难-12-red.svg?" alt="">
</p>
<h1 align="center">LeetCode 的解答</h1>

<p align="center">
    <br>
    <b>最近一次更新: 2020-03-11 22:42:09</b>
    <br>
</p>
<!--请保留下面这行信息，让更多用户了解到这个小爬虫，衷心感谢您的支持-->
<p align="center">The source code is fetched using the tool <a href="https://github.com/KivenCkl/LeetCode_Helper">LeetCode_Helper</a>.</p>

| # | 题名 | 解答 | 通过率 | 难度 | 标签 |
|:--:|:-----|:---------:|:----:|:----:|:----:|
|LCP 1|[猜数字](Problemset/guess-numbers/README.md)|[Python](Problemset/guess-numbers/guess-numbers.py)|82.3%|简单||
|1131|[绝对值表达式的最大值](Problemset/maximum-of-absolute-value-expression/README.md)|[Python](Problemset/maximum-of-absolute-value-expression/maximum-of-absolute-value-expression.py)|39.1%|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[数学](https://leetcode-cn.com/tag/math)|
|1128|[等价多米诺骨牌对的数量](Problemset/number-of-equivalent-domino-pairs/README.md)|[Python](Problemset/number-of-equivalent-domino-pairs/number-of-equivalent-domino-pairs.py)|42.7%|简单|[数组](https://leetcode-cn.com/tag/array)|
|1122|[数组的相对排序](Problemset/relative-sort-array/README.md)|[Python](Problemset/relative-sort-array/relative-sort-array.py)<br>[Go](Problemset/relative-sort-array/relative-sort-array.go)|65.3%|简单|[排序](https://leetcode-cn.com/tag/sort)<br>[数组](https://leetcode-cn.com/tag/array)|
|1109|[航班预订统计](Problemset/corporate-flight-bookings/README.md)|[Go](Problemset/corporate-flight-bookings/corporate-flight-bookings.go)<br>[Python](Problemset/corporate-flight-bookings/corporate-flight-bookings.py)|40.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[数学](https://leetcode-cn.com/tag/math)|
|1108|[IP 地址无效化](Problemset/defanging-an-ip-address/README.md)|[Python](Problemset/defanging-an-ip-address/defanging-an-ip-address.py)<br>[Go](Problemset/defanging-an-ip-address/defanging-an-ip-address.go)|81.4%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|1106|[解析布尔表达式](Problemset/parsing-a-boolean-expression/README.md)|[Python](Problemset/parsing-a-boolean-expression/parsing-a-boolean-expression.py)<br>[Go](Problemset/parsing-a-boolean-expression/parsing-a-boolean-expression.go)|53.6%|困难|[字符串](https://leetcode-cn.com/tag/string)|
|1103|[分糖果 II](Problemset/distribute-candies-to-people/README.md)|[Python](Problemset/distribute-candies-to-people/distribute-candies-to-people.py)<br>[Go](Problemset/distribute-candies-to-people/distribute-candies-to-people.go)|62.8%|简单|[数学](https://leetcode-cn.com/tag/math)|
|1094|[拼车](Problemset/car-pooling/README.md)|[Python](Problemset/car-pooling/car-pooling.py)<br>[Go](Problemset/car-pooling/car-pooling.go)|52.3%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)|
|1093|[大样本统计](Problemset/statistics-from-a-large-sample/README.md)|[Python](Problemset/statistics-from-a-large-sample/statistics-from-a-large-sample.py)<br>[Go](Problemset/statistics-from-a-large-sample/statistics-from-a-large-sample.go)|39.7%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|1089|[复写零](Problemset/duplicate-zeros/README.md)|[Python](Problemset/duplicate-zeros/duplicate-zeros.py)<br>[Go](Problemset/duplicate-zeros/duplicate-zeros.go)|57.5%|简单|[数组](https://leetcode-cn.com/tag/array)|
|1079|[活字印刷](Problemset/letter-tile-possibilities/README.md)|[Python](Problemset/letter-tile-possibilities/letter-tile-possibilities.py)<br>[Go](Problemset/letter-tile-possibilities/letter-tile-possibilities.go)|72.2%|中等|[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|1081|[不同字符的最小子序列](Problemset/smallest-subsequence-of-distinct-characters/README.md)|[Python](Problemset/smallest-subsequence-of-distinct-characters/smallest-subsequence-of-distinct-characters.py)<br>[Go](Problemset/smallest-subsequence-of-distinct-characters/smallest-subsequence-of-distinct-characters.go)|44.3%|中等|[字符串](https://leetcode-cn.com/tag/string)|
|1080|[根到叶路径上的不足节点](Problemset/insufficient-nodes-in-root-to-leaf-paths/README.md)|[Python](Problemset/insufficient-nodes-in-root-to-leaf-paths/insufficient-nodes-in-root-to-leaf-paths.py)<br>[Go](Problemset/insufficient-nodes-in-root-to-leaf-paths/insufficient-nodes-in-root-to-leaf-paths.go)|43.6%|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)|
|1078|[Bigram 分词](Problemset/occurrences-after-bigram/README.md)|[Python](Problemset/occurrences-after-bigram/occurrences-after-bigram.py)<br>[Go](Problemset/occurrences-after-bigram/occurrences-after-bigram.go)|60.5%|简单|[哈希表](https://leetcode-cn.com/tag/hash-table)|
|1073|[负二进制数相加](Problemset/adding-two-negabinary-numbers/README.md)|[Python](Problemset/adding-two-negabinary-numbers/adding-two-negabinary-numbers.py)<br>[Go](Problemset/adding-two-negabinary-numbers/adding-two-negabinary-numbers.go)|29.9%|中等|[数学](https://leetcode-cn.com/tag/math)|
|1072|[按列翻转得到最大值等行数](Problemset/flip-columns-for-maximum-number-of-equal-rows/README.md)|[Python](Problemset/flip-columns-for-maximum-number-of-equal-rows/flip-columns-for-maximum-number-of-equal-rows.py)<br>[Go](Problemset/flip-columns-for-maximum-number-of-equal-rows/flip-columns-for-maximum-number-of-equal-rows.go)|49.2%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)|
|1071|[字符串的最大公因子](Problemset/greatest-common-divisor-of-strings/README.md)|[Python](Problemset/greatest-common-divisor-of-strings/greatest-common-divisor-of-strings.py)<br>[Go](Problemset/greatest-common-divisor-of-strings/greatest-common-divisor-of-strings.go)|49.9%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|1054|[距离相等的条形码](Problemset/distant-barcodes/README.md)|[Python](Problemset/distant-barcodes/distant-barcodes.py)|32.2%|中等|[堆](https://leetcode-cn.com/tag/heap)<br>[排序](https://leetcode-cn.com/tag/sort)|
|1053|[交换一次的先前排列](Problemset/previous-permutation-with-one-swap/README.md)|[Python](Problemset/previous-permutation-with-one-swap/previous-permutation-with-one-swap.py)|42.4%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[数组](https://leetcode-cn.com/tag/array)|
|1052|[爱生气的书店老板](Problemset/grumpy-bookstore-owner/README.md)|[Python](Problemset/grumpy-bookstore-owner/grumpy-bookstore-owner.py)|47.6%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[None](https://leetcode-cn.com/tag/sliding-window)|
|1051|[高度检查器](Problemset/height-checker/README.md)|[Python](Problemset/height-checker/height-checker.py)|72.7%|简单|[数组](https://leetcode-cn.com/tag/array)|
|1049|[最后一块石头的重量 II](Problemset/last-stone-weight-ii/README.md)|[Python](Problemset/last-stone-weight-ii/last-stone-weight-ii.py)|40.9%|中等|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|1048|[最长字符串链](Problemset/longest-string-chain/README.md)|[Python](Problemset/longest-string-chain/longest-string-chain.py)|40.1%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|1047|[删除字符串中的所有相邻重复项](Problemset/remove-all-adjacent-duplicates-in-string/README.md)|[Python](Problemset/remove-all-adjacent-duplicates-in-string/remove-all-adjacent-duplicates-in-string.py)|67.1%|简单|[栈](https://leetcode-cn.com/tag/stack)|
|1046|[最后一块石头的重量](Problemset/last-stone-weight/README.md)|[Python](Problemset/last-stone-weight/last-stone-weight.py)|59.5%|简单|[堆](https://leetcode-cn.com/tag/heap)<br>[贪心算法](https://leetcode-cn.com/tag/greedy)|
|1044|[最长重复子串](Problemset/longest-duplicate-substring/README.md)|[Python](Problemset/longest-duplicate-substring/longest-duplicate-substring.py)|16.7%|困难|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|1043|[分隔数组以得到最大和](Problemset/partition-array-for-maximum-sum/README.md)|[Python](Problemset/partition-array-for-maximum-sum/partition-array-for-maximum-sum.py)|64.4%|中等|[图](https://leetcode-cn.com/tag/graph)|
|1042|[不邻接植花](Problemset/flower-planting-with-no-adjacent/README.md)|[Python](Problemset/flower-planting-with-no-adjacent/flower-planting-with-no-adjacent.py)|48.3%|简单|[图](https://leetcode-cn.com/tag/graph)|
|1041|[困于环中的机器人](Problemset/robot-bounded-in-circle/README.md)|[Python](Problemset/robot-bounded-in-circle/robot-bounded-in-circle.py)|43.2%|中等|[数学](https://leetcode-cn.com/tag/math)|
|1037|[有效的回旋镖](Problemset/valid-boomerang/README.md)|[Python](Problemset/valid-boomerang/valid-boomerang.py)|41.0%|简单|[数学](https://leetcode-cn.com/tag/math)|
|1038|[从二叉搜索树到更大和树](Problemset/binary-search-tree-to-greater-sum-tree/README.md)|[Python](Problemset/binary-search-tree-to-greater-sum-tree/binary-search-tree-to-greater-sum-tree.py)|72.7%|中等|[二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree)|
|1040|[移动石子直到连续 II](Problemset/moving-stones-until-consecutive-ii/README.md)|[Python](Problemset/moving-stones-until-consecutive-ii/moving-stones-until-consecutive-ii.py)|45.7%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[None](https://leetcode-cn.com/tag/sliding-window)|
|1039|[多边形三角剖分的最低得分](Problemset/minimum-score-triangulation-of-polygon/README.md)|[Python](Problemset/minimum-score-triangulation-of-polygon/minimum-score-triangulation-of-polygon.py)|47.5%|中等|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|1035|[不相交的线](Problemset/uncrossed-lines/README.md)|[Python](Problemset/uncrossed-lines/uncrossed-lines.py)|51.3%|中等|[数组](https://leetcode-cn.com/tag/array)|
|1056|[易混淆数](Problemset/confusing-number/README.md)🔒|[Python](Problemset/confusing-number/confusing-number.py)|34.4%|简单|[数学](https://leetcode-cn.com/tag/math)|
|1060|[有序数组中的缺失元素](Problemset/missing-element-in-sorted-array/README.md)🔒|[Python](Problemset/missing-element-in-sorted-array/missing-element-in-sorted-array.py)|46.8%|中等|[二分查找](https://leetcode-cn.com/tag/binary-search)|
|1061|[按字典序排列最小的等效字符串](Problemset/lexicographically-smallest-equivalent-string/README.md)🔒|[Python](Problemset/lexicographically-smallest-equivalent-string/lexicographically-smallest-equivalent-string.py)|47.7%|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)<br>[并查集](https://leetcode-cn.com/tag/union-find)|
|1058|[最小化舍入误差以满足目标](Problemset/minimize-rounding-error-to-meet-target/README.md)🔒|[Python](Problemset/minimize-rounding-error-to-meet-target/minimize-rounding-error-to-meet-target.py)|28.2%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[数学](https://leetcode-cn.com/tag/math)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|1057|[校园自行车分配](Problemset/campus-bikes/README.md)🔒|[Python](Problemset/campus-bikes/campus-bikes.py)|35.7%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[排序](https://leetcode-cn.com/tag/sort)|
|931|[下降路径最小和](Problemset/minimum-falling-path-sum/README.md)|[Python](Problemset/minimum-falling-path-sum/minimum-falling-path-sum.py)|59.9%|中等|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|905|[按奇偶排序数组](Problemset/sort-array-by-parity/README.md)|[Python](Problemset/sort-array-by-parity/sort-array-by-parity.py)|68.2%|简单|[数组](https://leetcode-cn.com/tag/array)|
|887|[鸡蛋掉落](Problemset/super-egg-drop/README.md)|[Python](Problemset/super-egg-drop/super-egg-drop.py)|21.3%|困难|[数学](https://leetcode-cn.com/tag/math)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|867|[转置矩阵](Problemset/transpose-matrix/README.md)|[Python](Problemset/transpose-matrix/transpose-matrix.py)|67.2%|简单|[数组](https://leetcode-cn.com/tag/array)|
|849|[到最近的人的最大距离](Problemset/maximize-distance-to-closest-person/README.md)|[Python](Problemset/maximize-distance-to-closest-person/maximize-distance-to-closest-person.py)|39.2%|简单|[数组](https://leetcode-cn.com/tag/array)|
|840|[矩阵中的幻方](Problemset/magic-squares-in-grid/README.md)|[Python](Problemset/magic-squares-in-grid/magic-squares-in-grid.py)|33.5%|简单|[数组](https://leetcode-cn.com/tag/array)|
|641|[设计循环双端队列](Problemset/design-circular-deque/README.md)|[Python](Problemset/design-circular-deque/design-circular-deque.py)|49.3%|中等|[设计](https://leetcode-cn.com/tag/design)<br>[队列](https://leetcode-cn.com/tag/queue)|
|830|[较大分组的位置](Problemset/positions-of-large-groups/README.md)|[Python](Problemset/positions-of-large-groups/positions-of-large-groups.py)|46.1%|简单|[数组](https://leetcode-cn.com/tag/array)|
|825|[适龄的朋友](Problemset/friends-of-appropriate-ages/README.md)|[Python](Problemset/friends-of-appropriate-ages/friends-of-appropriate-ages.py)|33.8%|中等|[数组](https://leetcode-cn.com/tag/array)|
|792|[匹配子序列的单词数](Problemset/number-of-matching-subsequences/README.md)|[Python](Problemset/number-of-matching-subsequences/number-of-matching-subsequences.py)|42.0%|中等|[数组](https://leetcode-cn.com/tag/array)|
|775|[全局倒置与局部倒置](Problemset/global-and-local-inversions/README.md)|[Python](Problemset/global-and-local-inversions/global-and-local-inversions.py)|42.5%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[数学](https://leetcode-cn.com/tag/math)|
|766|[托普利茨矩阵](Problemset/toeplitz-matrix/README.md)|[Python](Problemset/toeplitz-matrix/toeplitz-matrix.py)|64.2%|简单|[数组](https://leetcode-cn.com/tag/array)|
|747|[至少是其他数字两倍的最大数](Problemset/largest-number-at-least-twice-of-others/README.md)|[Python](Problemset/largest-number-at-least-twice-of-others/largest-number-at-least-twice-of-others.py)|39.0%|简单|[数组](https://leetcode-cn.com/tag/array)|
|746|[使用最小花费爬楼梯](Problemset/min-cost-climbing-stairs/README.md)|[Python](Problemset/min-cost-climbing-stairs/min-cost-climbing-stairs.py)|47.2%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|739|[每日温度](Problemset/daily-temperatures/README.md)|[Python](Problemset/daily-temperatures/daily-temperatures.py)|59.1%|中等|[栈](https://leetcode-cn.com/tag/stack)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|724|[寻找数组的中心索引](Problemset/find-pivot-index/README.md)|[Python](Problemset/find-pivot-index/find-pivot-index.py)|36.4%|简单|[数组](https://leetcode-cn.com/tag/array)|
|718|[最长重复子数组](Problemset/maximum-length-of-repeated-subarray/README.md)|[Python](Problemset/maximum-length-of-repeated-subarray/maximum-length-of-repeated-subarray.py)|49.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|717|[1比特与2比特字符](Problemset/1-bit-and-2-bit-characters/README.md)|[Python](Problemset/1-bit-and-2-bit-characters/1-bit-and-2-bit-characters.py)|46.8%|简单|[数组](https://leetcode-cn.com/tag/array)|
|713|[乘积小于K的子数组](Problemset/subarray-product-less-than-k/README.md)|[Python](Problemset/subarray-product-less-than-k/subarray-product-less-than-k.py)|34.8%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|698|[划分为k个相等的子集](Problemset/partition-to-k-equal-sum-subsets/README.md)|[Python](Problemset/partition-to-k-equal-sum-subsets/partition-to-k-equal-sum-subsets.py)|40.9%|中等|[递归](https://leetcode-cn.com/tag/recursion)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|697|[数组的度](Problemset/degree-of-an-array/README.md)|[Python](Problemset/degree-of-an-array/degree-of-an-array.py)|52.0%|简单|[数组](https://leetcode-cn.com/tag/array)|
|695|[岛屿的最大面积](Problemset/max-area-of-island/README.md)|[Python](Problemset/max-area-of-island/max-area-of-island.py)|59.8%|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)<br>[数组](https://leetcode-cn.com/tag/array)|
|674|[最长连续递增序列](Problemset/longest-continuous-increasing-subsequence/README.md)|[Python](Problemset/longest-continuous-increasing-subsequence/longest-continuous-increasing-subsequence.py)|44.1%|简单|[数组](https://leetcode-cn.com/tag/array)|
|670|[最大交换](Problemset/maximum-swap/README.md)|[Python](Problemset/maximum-swap/maximum-swap.py)|39.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[数学](https://leetcode-cn.com/tag/math)|
|667|[优美的排列 II](Problemset/beautiful-arrangement-ii/README.md)|[Python](Problemset/beautiful-arrangement-ii/beautiful-arrangement-ii.py)|58.8%|中等|[数组](https://leetcode-cn.com/tag/array)|
|665|[非递减数列](Problemset/non-decreasing-array/README.md)|[Python](Problemset/non-decreasing-array/non-decreasing-array.py)|22.0%|简单|[数组](https://leetcode-cn.com/tag/array)|
|661|[图片平滑器](Problemset/image-smoother/README.md)|[Python](Problemset/image-smoother/image-smoother.py)|52.7%|简单|[数组](https://leetcode-cn.com/tag/array)|
|649|[Dota2 参议院](Problemset/dota2-senate/README.md)|[Python](Problemset/dota2-senate/dota2-senate.py)|37.2%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)|
|647|[回文子串](Problemset/palindromic-substrings/README.md)|[Python](Problemset/palindromic-substrings/palindromic-substrings.py)|61.1%|中等|[字符串](https://leetcode-cn.com/tag/string)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|643|[子数组最大平均数 I](Problemset/maximum-average-subarray-i/README.md)|[Python](Problemset/maximum-average-subarray-i/maximum-average-subarray-i.py)|38.0%|简单|[数组](https://leetcode-cn.com/tag/array)|
|628|[三个数的最大乘积](Problemset/maximum-product-of-three-numbers/README.md)|[Python](Problemset/maximum-product-of-three-numbers/maximum-product-of-three-numbers.py)|49.3%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[数学](https://leetcode-cn.com/tag/math)|
|621|[任务调度器](Problemset/task-scheduler/README.md)|[Python](Problemset/task-scheduler/task-scheduler.py)|48.0%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[队列](https://leetcode-cn.com/tag/queue)<br>[数组](https://leetcode-cn.com/tag/array)|
|617|[合并二叉树](Problemset/merge-two-binary-trees/README.md)|[Python](Problemset/merge-two-binary-trees/merge-two-binary-trees.py)|75.2%|简单|[树](https://leetcode-cn.com/tag/tree)|
|611|[有效三角形的个数](Problemset/valid-triangle-number/README.md)|[Python](Problemset/valid-triangle-number/valid-triangle-number.py)|48.6%|中等|[数组](https://leetcode-cn.com/tag/array)|
|605|[种花问题](Problemset/can-place-flowers/README.md)|[Python](Problemset/can-place-flowers/can-place-flowers.py)|31.4%|简单|[数组](https://leetcode-cn.com/tag/array)|
|581|[最短无序连续子数组](Problemset/shortest-unsorted-continuous-subarray/README.md)|[Python](Problemset/shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray.py)|34.1%|简单|[数组](https://leetcode-cn.com/tag/array)|
|566|[重塑矩阵](Problemset/reshape-the-matrix/README.md)|[Python](Problemset/reshape-the-matrix/reshape-the-matrix.py)|64.1%|简单|[数组](https://leetcode-cn.com/tag/array)|
|565|[数组嵌套](Problemset/array-nesting/README.md)|[Python](Problemset/array-nesting/array-nesting.py)|56.1%|中等|[数组](https://leetcode-cn.com/tag/array)|
|561|[数组拆分 I](Problemset/array-partition-i/README.md)|[Python](Problemset/array-partition-i/array-partition-i.py)|69.8%|简单|[数组](https://leetcode-cn.com/tag/array)|
|560|[和为K的子数组](Problemset/subarray-sum-equals-k/README.md)|[Python](Problemset/subarray-sum-equals-k/subarray-sum-equals-k.py)|44.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|557|[反转字符串中的单词 III](Problemset/reverse-words-in-a-string-iii/README.md)|[Python](Problemset/reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.py)|69.7%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|543|[二叉树的直径](Problemset/diameter-of-binary-tree/README.md)|[Python](Problemset/diameter-of-binary-tree/diameter-of-binary-tree.py)|48.8%|简单|[树](https://leetcode-cn.com/tag/tree)|
|538|[把二叉搜索树转换为累加树](Problemset/convert-bst-to-greater-tree/README.md)|[Python](Problemset/convert-bst-to-greater-tree/convert-bst-to-greater-tree.py)|59.3%|简单|[树](https://leetcode-cn.com/tag/tree)|
|532|[数组中的K-diff数对](Problemset/k-diff-pairs-in-an-array/README.md)|[Python](Problemset/k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.py)|33.9%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|1059|[从始点到终点的所有路径](Problemset/all-paths-from-source-lead-to-destination/README.md)🔒|[Python](Problemset/all-paths-from-source-lead-to-destination/all-paths-from-source-lead-to-destination.py)|28.0%|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)<br>[图](https://leetcode-cn.com/tag/graph)|
|495|[提莫攻击](Problemset/teemo-attacking/README.md)|[Python](Problemset/teemo-attacking/teemo-attacking.py)|52.9%|中等|[数组](https://leetcode-cn.com/tag/array)|
|494|[目标和](Problemset/target-sum/README.md)|[Python](Problemset/target-sum/target-sum.py)|43.6%|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|485|[最大连续1的个数](Problemset/max-consecutive-ones/README.md)|[Python](Problemset/max-consecutive-ones/max-consecutive-ones.py)|55.9%|简单|[数组](https://leetcode-cn.com/tag/array)|
|480|[滑动窗口中位数](Problemset/sliding-window-median/README.md)|[Python](Problemset/sliding-window-median/sliding-window-median.py)|33.7%|困难|[None](https://leetcode-cn.com/tag/sliding-window)|
|461|[汉明距离](Problemset/hamming-distance/README.md)|[Python](Problemset/hamming-distance/hamming-distance.py)|75.2%|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation)|
|459|[重复的子字符串](Problemset/repeated-substring-pattern/README.md)|[Python](Problemset/repeated-substring-pattern/repeated-substring-pattern.py)|45.6%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|454|[四数相加 II](Problemset/4sum-ii/README.md)|[Python](Problemset/4sum-ii/4sum-ii.py)|54.5%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|448|[找到所有数组中消失的数字](Problemset/find-all-numbers-disappeared-in-an-array/README.md)|[Python](Problemset/find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.py)|56.9%|简单|[数组](https://leetcode-cn.com/tag/array)|
|442|[数组中重复的数据](Problemset/find-all-duplicates-in-an-array/README.md)|[Python](Problemset/find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.py)|64.2%|中等|[数组](https://leetcode-cn.com/tag/array)|
|438|[找到字符串中所有字母异位词](Problemset/find-all-anagrams-in-a-string/README.md)|[Python](Problemset/find-all-anagrams-in-a-string/find-all-anagrams-in-a-string.py)|41.7%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)|
|416|[分割等和子集](Problemset/partition-equal-subset-sum/README.md)|[Go](Problemset/partition-equal-subset-sum/partition-equal-subset-sum.go)<br>[Python](Problemset/partition-equal-subset-sum/partition-equal-subset-sum.py)|45.8%|中等|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|414|[第三大的数](Problemset/third-maximum-number/README.md)|[Python](Problemset/third-maximum-number/third-maximum-number.py)|34.5%|简单|[数组](https://leetcode-cn.com/tag/array)|
|406|[根据身高重建队列](Problemset/queue-reconstruction-by-height/README.md)|[Python](Problemset/queue-reconstruction-by-height/queue-reconstruction-by-height.py)|63.1%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)|
|387|[字符串中的第一个唯一字符](Problemset/first-unique-character-in-a-string/README.md)|[Python](Problemset/first-unique-character-in-a-string/first-unique-character-in-a-string.py)|43.7%|简单|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[字符串](https://leetcode-cn.com/tag/string)|
|384|[打乱数组](Problemset/shuffle-an-array/README.md)|[Python](Problemset/shuffle-an-array/shuffle-an-array.py)|49.9%|中等||
|380|[常数时间插入、删除和获取随机元素](Problemset/insert-delete-getrandom-o1/README.md)|[Python](Problemset/insert-delete-getrandom-o1/insert-delete-getrandom-o1.py)|48.0%|中等|[设计](https://leetcode-cn.com/tag/design)<br>[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|350|[两个数组的交集 II](Problemset/intersection-of-two-arrays-ii/README.md)|[Python](Problemset/intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.py)|47.1%|简单|[排序](https://leetcode-cn.com/tag/sort)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|344|[反转字符串](Problemset/reverse-string/README.md)|[Python](Problemset/reverse-string/reverse-string.py)|69.3%|简单|[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[字符串](https://leetcode-cn.com/tag/string)|
|334|[递增的三元子序列](Problemset/increasing-triplet-subsequence/README.md)|[Python](Problemset/increasing-triplet-subsequence/increasing-triplet-subsequence.py)|37.2%|中等||
|292|[Nim 游戏](Problemset/nim-game/README.md)|[Python](Problemset/nim-game/nim-game.py)|69.7%|简单|[脑筋急转弯](https://leetcode-cn.com/tag/brainteaser)<br>[极小化极大](https://leetcode-cn.com/tag/minimax)|
|287|[寻找重复数](Problemset/find-the-duplicate-number/README.md)|[Python](Problemset/find-the-duplicate-number/find-the-duplicate-number.py)|63.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|283|[移动零](Problemset/move-zeroes/README.md)|[Python](Problemset/move-zeroes/move-zeroes.py)|59.8%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|268|[缺失数字](Problemset/missing-number/README.md)|[Python](Problemset/missing-number/missing-number.py)|54.6%|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[数组](https://leetcode-cn.com/tag/array)<br>[数学](https://leetcode-cn.com/tag/math)|
|242|[有效的字母异位词](Problemset/valid-anagram/README.md)|[Python](Problemset/valid-anagram/valid-anagram.py)|58.8%|简单|[排序](https://leetcode-cn.com/tag/sort)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|240|[搜索二维矩阵 II](Problemset/search-a-2d-matrix-ii/README.md)|[Python](Problemset/search-a-2d-matrix-ii/search-a-2d-matrix-ii.py)|39.3%|中等|[二分查找](https://leetcode-cn.com/tag/binary-search)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)|
|238|[除自身以外数组的乘积](Problemset/product-of-array-except-self/README.md)|[Python](Problemset/product-of-array-except-self/product-of-array-except-self.py)|66.9%|中等|[数组](https://leetcode-cn.com/tag/array)|
|237|[删除链表中的节点](Problemset/delete-node-in-a-linked-list/README.md)|[Python](Problemset/delete-node-in-a-linked-list/delete-node-in-a-linked-list.py)|80.3%|简单|[链表](https://leetcode-cn.com/tag/linked-list)|
|236|[二叉树的最近公共祖先](Problemset/lowest-common-ancestor-of-a-binary-tree/README.md)|[Python](Problemset/lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.py)|60.4%|中等|[树](https://leetcode-cn.com/tag/tree)|
|235|[二叉搜索树的最近公共祖先](Problemset/lowest-common-ancestor-of-a-binary-search-tree/README.md)|[Python](Problemset/lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.py)|62.7%|简单|[树](https://leetcode-cn.com/tag/tree)|
|231|[2的幂](Problemset/power-of-two/README.md)|[Python](Problemset/power-of-two/power-of-two.py)|47.8%|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[数学](https://leetcode-cn.com/tag/math)|
|230|[二叉搜索树中第K小的元素](Problemset/kth-smallest-element-in-a-bst/README.md)|[Python](Problemset/kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.py)|69.1%|中等|[树](https://leetcode-cn.com/tag/tree)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|228|[汇总区间](Problemset/summary-ranges/README.md)|[Python](Problemset/summary-ranges/summary-ranges.py)|51.5%|中等|[数组](https://leetcode-cn.com/tag/array)|
|219|[存在重复元素 II](Problemset/contains-duplicate-ii/README.md)|[Python](Problemset/contains-duplicate-ii/contains-duplicate-ii.py)|37.8%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|217|[存在重复元素](Problemset/contains-duplicate/README.md)|[Python](Problemset/contains-duplicate/contains-duplicate.py)|51.7%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|216|[组合总和 III](Problemset/combination-sum-iii/README.md)|[Python](Problemset/combination-sum-iii/combination-sum-iii.py)|70.4%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|215|[数组中的第K个最大元素](Problemset/kth-largest-element-in-an-array/README.md)|[Python](Problemset/kth-largest-element-in-an-array/kth-largest-element-in-an-array.py)<br>[Go](Problemset/kth-largest-element-in-an-array/kth-largest-element-in-an-array.go)|61.4%|中等|[堆](https://leetcode-cn.com/tag/heap)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)|
|206|[反转链表](Problemset/reverse-linked-list/README.md)|[Python](Problemset/reverse-linked-list/reverse-linked-list.py)|68.0%|简单|[链表](https://leetcode-cn.com/tag/linked-list)|
|189|[旋转数组](Problemset/rotate-array/README.md)|[Python](Problemset/rotate-array/rotate-array.py)|40.7%|简单|[数组](https://leetcode-cn.com/tag/array)|
|171|[Excel表列序号](Problemset/excel-sheet-column-number/README.md)|[Python](Problemset/excel-sheet-column-number/excel-sheet-column-number.py)|66.7%|简单|[数学](https://leetcode-cn.com/tag/math)|
|169|[多数元素](Problemset/majority-element/README.md)|[Python](Problemset/majority-element/majority-element.py)|61.8%|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[数组](https://leetcode-cn.com/tag/array)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)|
|167|[两数之和 II - 输入有序数组](Problemset/two-sum-ii-input-array-is-sorted/README.md)|[Python](Problemset/two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py)|52.9%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|162|[寻找峰值](Problemset/find-peak-element/README.md)|[Python](Problemset/find-peak-element/find-peak-element.py)|45.1%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|155|[最小栈](Problemset/min-stack/README.md)|[Python](Problemset/min-stack/min-stack.py)<br>[Go](Problemset/min-stack/min-stack.go)|51.9%|简单|[栈](https://leetcode-cn.com/tag/stack)<br>[设计](https://leetcode-cn.com/tag/design)|
|153|[寻找旋转排序数组中的最小值](Problemset/find-minimum-in-rotated-sorted-array/README.md)|[Python](Problemset/find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.py)|50.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|152|[乘积最大子序列](Problemset/maximum-product-subarray/README.md)|[Python](Problemset/maximum-product-subarray/maximum-product-subarray.py)|37.4%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|146|[LRU缓存机制](Problemset/lru-cache/README.md)|[Go](Problemset/lru-cache/lru-cache.go)<br>[Python](Problemset/lru-cache/lru-cache.py)|46.2%|中等|[设计](https://leetcode-cn.com/tag/design)|
|141|[环形链表](Problemset/linked-list-cycle/README.md)|[Python](Problemset/linked-list-cycle/linked-list-cycle.py)|46.9%|简单|[链表](https://leetcode-cn.com/tag/linked-list)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|136|[只出现一次的数字](Problemset/single-number/README.md)|[Python](Problemset/single-number/single-number.py)|65.7%|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|
|125|[验证回文串](Problemset/valid-palindrome/README.md)|[Python](Problemset/valid-palindrome/valid-palindrome.py)|42.8%|简单|[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[字符串](https://leetcode-cn.com/tag/string)|
|122|[买卖股票的最佳时机 II](Problemset/best-time-to-buy-and-sell-stock-ii/README.md)|[Python](Problemset/best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.py)|58.0%|简单|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[数组](https://leetcode-cn.com/tag/array)|
|121|[买卖股票的最佳时机](Problemset/best-time-to-buy-and-sell-stock/README.md)|[Python](Problemset/best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.py)|53.6%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|120|[三角形最小路径和](Problemset/triangle/README.md)|[Python](Problemset/triangle/triangle.py)|63.9%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|119|[杨辉三角 II](Problemset/pascals-triangle-ii/README.md)|[Python](Problemset/pascals-triangle-ii/pascals-triangle-ii.py)|60.3%|简单|[数组](https://leetcode-cn.com/tag/array)|
|118|[杨辉三角](Problemset/pascals-triangle/README.md)|[Python](Problemset/pascals-triangle/pascals-triangle.py)|65.9%|简单|[数组](https://leetcode-cn.com/tag/array)|
|104|[二叉树的最大深度](Problemset/maximum-depth-of-binary-tree/README.md)|[Python](Problemset/maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.py)|72.5%|简单|[树](https://leetcode-cn.com/tag/tree)<br>[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search)|
|90|[子集 II](Problemset/subsets-ii/README.md)|[Python](Problemset/subsets-ii/subsets-ii.py)|59.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|89|[格雷编码](Problemset/gray-code/README.md)|[Python](Problemset/gray-code/gray-code.py)|67.8%|中等|[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|88|[合并两个有序数组](Problemset/merge-sorted-array/README.md)|[Python](Problemset/merge-sorted-array/merge-sorted-array.py)|46.9%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|81|[搜索旋转排序数组 II](Problemset/search-in-rotated-sorted-array-ii/README.md)|[Python](Problemset/search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.py)|35.3%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|80|[删除排序数组中的重复项 II](Problemset/remove-duplicates-from-sorted-array-ii/README.md)|[Python](Problemset/remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.py)|54.7%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|78|[子集](Problemset/subsets/README.md)|[Python](Problemset/subsets/subsets.py)|76.7%|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation)<br>[数组](https://leetcode-cn.com/tag/array)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|77|[组合](Problemset/combinations/README.md)|[Python](Problemset/combinations/combinations.py)|73.1%|中等|[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|75|[颜色分类](Problemset/sort-colors/README.md)|[Python](Problemset/sort-colors/sort-colors.py)|54.7%|中等|[排序](https://leetcode-cn.com/tag/sort)<br>[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|74|[搜索二维矩阵](Problemset/search-a-2d-matrix/README.md)|[Python](Problemset/search-a-2d-matrix/search-a-2d-matrix.py)|37.6%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|73|[矩阵置零](Problemset/set-matrix-zeroes/README.md)|[Python](Problemset/set-matrix-zeroes/set-matrix-zeroes.py)|55.1%|中等|[数组](https://leetcode-cn.com/tag/array)|
|71|[简化路径](Problemset/simplify-path/README.md)|[Python](Problemset/simplify-path/simplify-path.py)|38.8%|中等|[栈](https://leetcode-cn.com/tag/stack)<br>[字符串](https://leetcode-cn.com/tag/string)|
|70|[爬楼梯](Problemset/climbing-stairs/README.md)|[Python](Problemset/climbing-stairs/climbing-stairs.py)|48.0%|简单|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|69|[x 的平方根](Problemset/sqrtx/README.md)|[Python](Problemset/sqrtx/sqrtx.py)<br>[Go](Problemset/sqrtx/sqrtx.go)|37.6%|简单|[数学](https://leetcode-cn.com/tag/math)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|66|[加一](Problemset/plus-one/README.md)|[Python](Problemset/plus-one/plus-one.py)|43.4%|简单|[数组](https://leetcode-cn.com/tag/array)|
|64|[最小路径和](Problemset/minimum-path-sum/README.md)|[Python](Problemset/minimum-path-sum/minimum-path-sum.py)|64.8%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|63|[不同路径 II](Problemset/unique-paths-ii/README.md)|[Python](Problemset/unique-paths-ii/unique-paths-ii.py)|32.5%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|62|[不同路径](Problemset/unique-paths/README.md)|[Python](Problemset/unique-paths/unique-paths.py)|59.2%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|61|[旋转链表](Problemset/rotate-list/README.md)|[Python](Problemset/rotate-list/rotate-list.py)|40.0%|中等|[链表](https://leetcode-cn.com/tag/linked-list)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|60|[第k个排列](Problemset/permutation-sequence/README.md)|[Python](Problemset/permutation-sequence/permutation-sequence.py)|48.4%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|59|[螺旋矩阵 II](Problemset/spiral-matrix-ii/README.md)|[Python](Problemset/spiral-matrix-ii/spiral-matrix-ii.py)|76.8%|中等|[数组](https://leetcode-cn.com/tag/array)|
|58|[最后一个单词的长度](Problemset/length-of-last-word/README.md)|[Python](Problemset/length-of-last-word/length-of-last-word.py)|32.6%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|56|[合并区间](Problemset/merge-intervals/README.md)|[Python](Problemset/merge-intervals/merge-intervals.py)|40.6%|中等|[排序](https://leetcode-cn.com/tag/sort)<br>[数组](https://leetcode-cn.com/tag/array)|
|55|[跳跃游戏](Problemset/jump-game/README.md)|[Python](Problemset/jump-game/jump-game.py)|38.3%|中等|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[数组](https://leetcode-cn.com/tag/array)|
|54|[螺旋矩阵](Problemset/spiral-matrix/README.md)|[Python](Problemset/spiral-matrix/spiral-matrix.py)|39.0%|中等|[数组](https://leetcode-cn.com/tag/array)|
|53|[最大子序和](Problemset/maximum-subarray/README.md)|[Python](Problemset/maximum-subarray/maximum-subarray.py)|49.6%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|50|[Pow(x, n)](Problemset/powx-n/README.md)|[Python](Problemset/powx-n/powx-n.py)|34.1%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|49|[字母异位词分组](Problemset/group-anagrams/README.md)|[Python](Problemset/group-anagrams/group-anagrams.py)|61.1%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[字符串](https://leetcode-cn.com/tag/string)|
|48|[旋转图像](Problemset/rotate-image/README.md)|[Python](Problemset/rotate-image/rotate-image.py)|67.2%|中等|[数组](https://leetcode-cn.com/tag/array)|
|47|[全排列 II](Problemset/permutations-ii/README.md)|[Python](Problemset/permutations-ii/permutations-ii.py)|57.3%|中等|[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|46|[全排列](Problemset/permutations/README.md)|[Python](Problemset/permutations/permutations.py)|74.3%|中等|[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|45|[跳跃游戏 II](Problemset/jump-game-ii/README.md)|[Python](Problemset/jump-game-ii/jump-game-ii.py)|33.4%|困难|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[数组](https://leetcode-cn.com/tag/array)|
|44|[通配符匹配](Problemset/wildcard-matching/README.md)|[Python](Problemset/wildcard-matching/wildcard-matching.py)|26.8%|困难|[贪心算法](https://leetcode-cn.com/tag/greedy)<br>[字符串](https://leetcode-cn.com/tag/string)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|43|[字符串相乘](Problemset/multiply-strings/README.md)|[Python](Problemset/multiply-strings/multiply-strings.py)|41.8%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[字符串](https://leetcode-cn.com/tag/string)|
|42|[接雨水](Problemset/trapping-rain-water/README.md)|[Python](Problemset/trapping-rain-water/trapping-rain-water.py)|49.2%|困难|[栈](https://leetcode-cn.com/tag/stack)<br>[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|41|[缺失的第一个正数](Problemset/first-missing-positive/README.md)|[Python](Problemset/first-missing-positive/first-missing-positive.py)|37.6%|困难|[数组](https://leetcode-cn.com/tag/array)|
|40|[组合总和 II](Problemset/combination-sum-ii/README.md)|[Python](Problemset/combination-sum-ii/combination-sum-ii.py)|60.6%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|39|[组合总和](Problemset/combination-sum/README.md)|[Python](Problemset/combination-sum/combination-sum.py)|68.6%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|38|[外观数列](Problemset/count-and-say/README.md)|[Python](Problemset/count-and-say/count-and-say.py)|54.6%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|37|[解数独](Problemset/sudoku-solver/README.md)|[Python](Problemset/sudoku-solver/sudoku-solver.py)|60.1%|困难|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|36|[有效的数独](Problemset/valid-sudoku/README.md)|[Python](Problemset/valid-sudoku/valid-sudoku.py)|58.7%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)|
|35|[搜索插入位置](Problemset/search-insert-position/README.md)|[Python](Problemset/search-insert-position/search-insert-position.py)|45.3%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|34|[在排序数组中查找元素的第一个和最后一个位置](Problemset/find-first-and-last-position-of-element-in-sorted-array/README.md)|[Python](Problemset/find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.py)|39.1%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|33|[搜索旋转排序数组](Problemset/search-in-rotated-sorted-array/README.md)|[Python](Problemset/search-in-rotated-sorted-array/search-in-rotated-sorted-array.py)|36.5%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|31|[下一个排列](Problemset/next-permutation/README.md)|[Python](Problemset/next-permutation/next-permutation.py)|32.9%|中等|[数组](https://leetcode-cn.com/tag/array)|
|29|[两数相除](Problemset/divide-two-integers/README.md)|[Python](Problemset/divide-two-integers/divide-two-integers.py)|19.3%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)|
|28|[实现 strStr()](Problemset/implement-strstr/README.md)|[Python](Problemset/implement-strstr/implement-strstr.py)|39.6%|简单|[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[字符串](https://leetcode-cn.com/tag/string)|
|27|[移除元素](Problemset/remove-element/README.md)|[Python](Problemset/remove-element/remove-element.py)|57.7%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|26|[删除排序数组中的重复项](Problemset/remove-duplicates-from-sorted-array/README.md)|[Python](Problemset/remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.py)|49.0%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|25|[K 个一组翻转链表](Problemset/reverse-nodes-in-k-group/README.md)|[Python](Problemset/reverse-nodes-in-k-group/reverse-nodes-in-k-group.py)|56.8%|困难|[链表](https://leetcode-cn.com/tag/linked-list)|
|24|[两两交换链表中的节点](Problemset/swap-nodes-in-pairs/README.md)|[Python](Problemset/swap-nodes-in-pairs/swap-nodes-in-pairs.py)|64.7%|中等|[链表](https://leetcode-cn.com/tag/linked-list)|
|23|[合并K个排序链表](Problemset/merge-k-sorted-lists/README.md)|[Python](Problemset/merge-k-sorted-lists/merge-k-sorted-lists.py)|49.3%|困难|[堆](https://leetcode-cn.com/tag/heap)<br>[链表](https://leetcode-cn.com/tag/linked-list)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)|
|22|[括号生成](Problemset/generate-parentheses/README.md)|[Python](Problemset/generate-parentheses/generate-parentheses.py)|73.5%|中等|[字符串](https://leetcode-cn.com/tag/string)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|21|[合并两个有序链表](Problemset/merge-two-sorted-lists/README.md)|[Python](Problemset/merge-two-sorted-lists/merge-two-sorted-lists.py)|60.3%|简单|[链表](https://leetcode-cn.com/tag/linked-list)|
|20|[有效的括号](Problemset/valid-parentheses/README.md)|[Python](Problemset/valid-parentheses/valid-parentheses.py)|41.1%|简单|[栈](https://leetcode-cn.com/tag/stack)<br>[字符串](https://leetcode-cn.com/tag/string)|
|19|[删除链表的倒数第N个节点](Problemset/remove-nth-node-from-end-of-list/README.md)|[Python](Problemset/remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.py)|37.9%|中等|[链表](https://leetcode-cn.com/tag/linked-list)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|18|[四数之和](Problemset/4sum/README.md)|[Python](Problemset/4sum/4sum.py)|37.3%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|17|[电话号码的字母组合](Problemset/letter-combinations-of-a-phone-number/README.md)|[Python](Problemset/letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.py)|52.8%|中等|[字符串](https://leetcode-cn.com/tag/string)<br>[回溯算法](https://leetcode-cn.com/tag/backtracking)|
|16|[最接近的三数之和](Problemset/3sum-closest/README.md)|[Python](Problemset/3sum-closest/3sum-closest.py)|43.3%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|15|[三数之和](Problemset/3sum/README.md)|[Python](Problemset/3sum/3sum.py)|25.9%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|14|[最长公共前缀](Problemset/longest-common-prefix/README.md)|[Python](Problemset/longest-common-prefix/longest-common-prefix.py)|36.5%|简单|[字符串](https://leetcode-cn.com/tag/string)|
|13|[罗马数字转整数](Problemset/roman-to-integer/README.md)|[Python](Problemset/roman-to-integer/roman-to-integer.py)|60.9%|简单|[数学](https://leetcode-cn.com/tag/math)<br>[字符串](https://leetcode-cn.com/tag/string)|
|12|[整数转罗马数字](Problemset/integer-to-roman/README.md)|[Python](Problemset/integer-to-roman/integer-to-roman.py)|62.8%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[字符串](https://leetcode-cn.com/tag/string)|
|11|[盛最多水的容器](Problemset/container-with-most-water/README.md)|[Python](Problemset/container-with-most-water/container-with-most-water.py)|61.8%|中等|[数组](https://leetcode-cn.com/tag/array)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)|
|9|[回文数](Problemset/palindrome-number/README.md)|[Python](Problemset/palindrome-number/palindrome-number.py)|57.2%|简单|[数学](https://leetcode-cn.com/tag/math)|
|8|[字符串转换整数 (atoi)](Problemset/string-to-integer-atoi/README.md)|[Python](Problemset/string-to-integer-atoi/string-to-integer-atoi.py)|19.3%|中等|[数学](https://leetcode-cn.com/tag/math)<br>[字符串](https://leetcode-cn.com/tag/string)|
|7|[整数反转](Problemset/reverse-integer/README.md)|[Python](Problemset/reverse-integer/reverse-integer.py)|33.8%|简单|[数学](https://leetcode-cn.com/tag/math)|
|6|[Z 字形变换](Problemset/zigzag-conversion/README.md)|[Python](Problemset/zigzag-conversion/zigzag-conversion.py)|47.0%|中等|[字符串](https://leetcode-cn.com/tag/string)|
|5|[最长回文子串](Problemset/longest-palindromic-substring/README.md)|[Python](Problemset/longest-palindromic-substring/longest-palindromic-substring.py)<br>[Go](Problemset/longest-palindromic-substring/longest-palindromic-substring.go)|28.8%|中等|[字符串](https://leetcode-cn.com/tag/string)<br>[动态规划](https://leetcode-cn.com/tag/dynamic-programming)|
|4|[寻找两个有序数组的中位数](Problemset/median-of-two-sorted-arrays/README.md)|[Python](Problemset/median-of-two-sorted-arrays/median-of-two-sorted-arrays.py)<br>[Go](Problemset/median-of-two-sorted-arrays/median-of-two-sorted-arrays.go)|37.1%|困难|[数组](https://leetcode-cn.com/tag/array)<br>[二分查找](https://leetcode-cn.com/tag/binary-search)<br>[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)|
|3|[无重复字符的最长子串](Problemset/longest-substring-without-repeating-characters/README.md)|[Python](Problemset/longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.py)<br>[Go](Problemset/longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.go)|33.3%|中等|[哈希表](https://leetcode-cn.com/tag/hash-table)<br>[双指针](https://leetcode-cn.com/tag/two-pointers)<br>[字符串](https://leetcode-cn.com/tag/string)<br>[None](https://leetcode-cn.com/tag/sliding-window)|
|2|[两数相加](Problemset/add-two-numbers/README.md)|[Python](Problemset/add-two-numbers/add-two-numbers.py)<br>[Go](Problemset/add-two-numbers/add-two-numbers.go)|36.9%|中等|[链表](https://leetcode-cn.com/tag/linked-list)<br>[数学](https://leetcode-cn.com/tag/math)|
|1|[两数之和](Problemset/two-sum/README.md)|[Python](Problemset/two-sum/two-sum.py)<br>[Go](Problemset/two-sum/two-sum.go)|47.8%|简单|[数组](https://leetcode-cn.com/tag/array)<br>[哈希表](https://leetcode-cn.com/tag/hash-table)|