FanluLeetcode

KO | EN

gitlite — search

#javascript #typescript #machine-learning #rust #docker #nodejs #java #kubernetes #vue #awesome-list #pytorch #mcp #ios #open-source

(★ 23)

Some best solutions written in Java

FanluLeetcode Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# FanluLeetcode

Leetcode 解题记录。根据题目的场景/标签归档，并以此位单位归纳总结。
- 题号：四位数字方便搜索定位。
- 总结：当前标签/主题相关的理论知识及解题套路和心得总结
- 地址：包括leetcode.com 和 leetcode-cn.com
- 难度：作者对题目难度的定义，会在官方给定难度等级之上通过`+`,`-`进行标记
- 代码：`Java`解法的代码，一般会包含最符合题意的解及效率最高解。并给出每种解的提交数据反馈。
- 结果：最优解的提交反馈数据
- 标签：相关标签，一般是最优或者最直观解法使用的算法思想
 
目前正在探索使用[Obisidian整理题解](https://github.com/Fanlu91/FanluLeetcode/blob/master/knowledge/guideToObsidianNotes.md)，逐渐提供比代码本身更有信息量的内容。
 
 
### Helper
README 文件通过[此类](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/helper/ReadMeGenerator.java)生成。

### Array
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0001|[two-sum](https://leetcode.com/problems/two-sum/)|[two-sum](https://leetcode-cn.com/problems/two-sum/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/TwoSum.java)|99.23%  99.75%|Array|
|0056|[merge-intervals](https://leetcode.com/problems/merge-intervals/)|[merge-intervals](https://leetcode-cn.com/problems/merge-intervals/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MergeIntervals.java)|92.20% 55.70%|Array|
|0066|[plus-one](https://leetcode.com/problems/plus-one/)|[plus-one](https://leetcode-cn.com/problems/plus-one/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/PlusOne.java)|100.00% 5.10%|Array|
|0118|[pascals-triangle](https://leetcode.com/problems/pascals-triangle/)|[pascals-triangle](https://leetcode-cn.com/problems/pascals-triangle/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/PascalsTriangle.java)|77.33% 9.09%|Array|
|0119|[pascals-triangle-ii](https://leetcode.com/problems/pascals-triangle-ii/)|[pascals-triangle-ii](https://leetcode-cn.com/problems/pascals-triangle-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/PascalsTriangleII.java)|86.51% 5.88%|Array|
|0169|[majority-element](https://leetcode.com/problems/majority-element/)|[majority-element](https://leetcode-cn.com/problems/majority-element/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MajorityElement.java)|100.00% 50.94%|Array|
|0189|[rotate-array](https://leetcode.com/problems/rotate-array/)|[rotate-array](https://leetcode-cn.com/problems/rotate-array/)|easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/RotateArray.java)|100% 100%%|Array|
|0217|[contains-duplicate](https://leetcode.com/problems/contains-duplicate/)|[contains-duplicate](https://leetcode-cn.com/problems/contains-duplicate/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/ContainsDuplicate.java)|99.06% 65.20%|Array|
|0228|[summary-ranges](https://leetcode.com/problems/summary-ranges/)|[summary-ranges](https://leetcode-cn.com/problems/summary-ranges/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/SummaryRanges.java)|8.88% 26.69%|Array|
|0283|[move-zeroes](https://leetcode.com/problems/move-zeroes/)|[move-zeroes](https://leetcode-cn.com/problems/move-zeroes/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MoveZeroes.java)|100.00% 94.20%|Array|
|0349|[intersection-of-two-arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[intersection-of-two-arrays](https://leetcode-cn.com/problems/intersection-of-two-arrays/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/IntersectionOfTwoArrays.java)|100% 50%|Array|
|0448|[find-all-numbers-disappeared-in-an-array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)|[find-all-numbers-disappeared-in-an-array](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/FindAllNumbersDisappearedInAnArray.java)|99.93% 61.97%|Array|
|0485|[max-consecutive-ones](https://leetcode.com/problems/max-consecutive-ones/)|[max-consecutive-ones](https://leetcode-cn.com/problems/max-consecutive-ones/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MaxConsecutiveOnes.java)|99.83% 99.97%|Array|
|0509|[fibonacci-number](https://leetcode.com/problems/fibonacci-number/)|[fibonacci-number](https://leetcode-cn.com/problems/fibonacci-number/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/FibonacciNumber.java)|100.00% 50.46%|Array|
|0561|[array-partition-i](https://leetcode.com/problems/array-partition-i/)|[array-partition-i](https://leetcode-cn.com/problems/array-partition-i/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/ArrayPartitionI.java)|100.00% 97.20%|Array|
|0697|[degree-of-an-array](https://leetcode.com/problems/degree-of-an-array/)|[degree-of-an-array](https://leetcode-cn.com/problems/degree-of-an-array/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/DegreeOfAnArray.java)|100.00% 54.88%|Array|
|0849|[maximize-distance-to-closest-person](https://leetcode.com/problems/maximize-distance-to-closest-person/)|[maximize-distance-to-closest-person](https://leetcode-cn.com/problems/maximize-distance-to-closest-person/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MaximizeDistanceToClosestPerson.java)|100.00% 91.67%|Array|
|0888|[fair-candy-swap](https://leetcode.com/problems/fair-candy-swap/)|[fair-candy-swap](https://leetcode-cn.com/problems/fair-candy-swap/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/FairCandySwap.java)|100.00% 98.74%|Array|
|0896|[monotonic-array](https://leetcode.com/problems/monotonic-array/)|[monotonic-array](https://leetcode-cn.com/problems/monotonic-array/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MonotonicArray.java)|100.00% 96.10%|Array|
|0905|[sort-array-by-parity](https://leetcode.com/problems/sort-array-by-parity/)|[sort-array-by-parity](https://leetcode-cn.com/problems/sort-array-by-parity/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/SortArrayByParity.java)|100.00% 96.91%|Array|
|0922|[sort-array-by-parity-ii](https://leetcode.com/problems/sort-array-by-parity-ii/)|[sort-array-by-parity-ii](https://leetcode-cn.com/problems/sort-array-by-parity-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/SortArrayByParityII.java)|99.72% 99.43%|Array|
|0945|[minimum-increment-to-make-array-unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique/)|[minimum-increment-to-make-array-unique](https://leetcode-cn.com/problems/minimum-increment-to-make-array-unique/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/MinimumIncrementToMakeArrayUnique.java)|97.81% 86.27%|Array|
|0977|[squares-of-a-sorted-array](https://leetcode.com/problems/squares-of-a-sorted-array/)|[squares-of-a-sorted-array](https://leetcode-cn.com/problems/squares-of-a-sorted-array/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/SquaresOfASortedArray.java)|100.00% 96.27%|Array|
|0985|[sum-of-even-numbers-after-queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/)|[sum-of-even-numbers-after-queries](https://leetcode-cn.com/problems/sum-of-even-numbers-after-queries/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/SumOfEvenNumbersAfterQueries.java)|99.93% 86.35%|Array|
|1002|[find-common-characters](https://leetcode.com/problems/find-common-characters/)|[find-common-characters](https://leetcode-cn.com/problems/find-common-characters/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/FindCommonCharacters.java)|100.00%  98.16%|Array|
|1013|[partition-array-into-three-parts-with-equal-sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/)|[partition-array-into-three-parts-with-equal-sum](https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/PartitionArrayIntoThreePartsWithEqualSum.java)|100.00% 90.69%|Array|
|1051|[height-checker](https://leetcode.com/problems/height-checker/)|[height-checker](https://leetcode-cn.com/problems/height-checker/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/HeightChecker.java)|96.41% 100.00%|Array|
|1103|[distribute-candies-to-people](https://leetcode.com/problems/distribute-candies-to-people/)|[distribute-candies-to-people](https://leetcode-cn.com/problems/distribute-candies-to-people/)|medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/array/DistributeCandiesToPeople.java)|8.10% 5.27%|Array|

### Dynamic Programming
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0064|[minimum-path-sum](https://leetcode.com/problems/minimum-path-sum/)|[minimum-path-sum](https://leetcode-cn.com/problems/minimum-path-sum/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/MinumumPathSum.java)|88.89% 26.71%|Dynamic Programming|
|0070|[climbing-stairs](https://leetcode.com/problems/climbing-stairs/)|[climbing-stairs](https://leetcode-cn.com/problems/climbing-stairs/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/ClimbingStairs.java)|100.00% 5.26%|Dynamic Programming|
|0121|[best-time-to-buy-and-sell-stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[best-time-to-buy-and-sell-stock](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStock.java)|100.00% 100.00%|Dynamic Programming|
|0122|[best-time-to-buy-and-sell-stock-ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)|[best-time-to-buy-and-sell-stock-ii](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStockII.java)|100.00% 100.00%|Dynamic Programming|
|0123|[best-time-to-buy-and-sell-stock-iii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)|[best-time-to-buy-and-sell-stock-iii](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStockIII.java)|99.75% 100.00%|Dynamic Programming|
|0188|[best-time-to-buy-and-sell-stock-iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)|[best-time-to-buy-and-sell-stock-iv](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStockIV.java)|100.00% 100.00%|Dynamic Programming|
|0198|[house-robber](https://leetcode.com/problems/house-robber/)|[house-robber](https://leetcode-cn.com/problems/house-robber/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/HouseRobber.java)|100.00% 100.00%|Dynamic Programming|
|0213|[house-robber-ii](https://leetcode.com/problems/house-robber-ii/)|[house-robber-ii](https://leetcode-cn.com/problems/house-robber-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/HouseRobberII.java)|100.00% 100.00%|Dynamic Programming|
|0256|[paint-house](https://leetcode.com/problems/paint-house/)|[paint-house](https://leetcode-cn.com/problems/paint-house/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/PaintHouse.java)|98.79% 100.00%|Dynamic Programming|
|0265|[paint-house-ii](https://leetcode.com/problems/paint-house-ii/)|[paint-house-ii](https://leetcode-cn.com/problems/paint-house-ii/)|Hard-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/PaintHouseII.java)|99.53% 100.00%|Dynamic Programming|
|0276|[paint-fence](https://leetcode.com.com/problems/paint-fence/)|[paint-fence](https://leetcode-cn.com/problems/paint-fence/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/PaintFence.java)|100% 100%|Dynamic Programming|
|0292|[nim-game](https://leetcode.com/problems/nim-game/)|[nim-game](https://leetcode-cn.com/problems/nim-game/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/NimGame.java)|100.00% 100.00%|Minimax|
|0303|[range-sum-query-immutable](https://leetcode.com/problems/range-sum-query-immutable/)|[range-sum-query-immutable](https://leetcode-cn.com/problems/range-sum-query-immutable/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/RangeSumQueryImmutable.java)|95.71% 56.10%|Dynamic Programming|
|0309|[best-time-to-buy-and-sell-stock-with-cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|[best-time-to-buy-and-sell-stock-with-cooldown](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStockWithCooldown.java)|100.00% 100.00%|Dynamic Programming|
|0322|[coin-change](https://leetcode.com/problems/coin-change/)|[coin-change](https://leetcode-cn.com/problems/coin-change/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/CoinChange.java)|99.99% 100%|Dynamic Programming|
|0337|[house-robber-iii](https://leetcode.com/problems/house-robber-iii/)|[house-robber-iii](https://leetcode-cn.com/problems/house-robber-iii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/HouseRobberIII.java)|100.00% 100.00%|Dynamic Programming|
|0338|[counting-bits](https://leetcode.com/problems/counting-bits/)|[counting-bits](https://leetcode-cn.com/problems/counting-bits/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/CountingBits.java)|100.00% 5.88%|Dynamic Programming|
|0375|[guess-number-higher-or-lower-ii](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)|[guess-number-higher-or-lower-ii](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/GuessNumberHigherOrLowerII.java)|99.47% 5.41%|Minimax|
|0486|[predict-the-winner](https://leetcode.com/problems/predict-the-winner/)|[predict-the-winner](https://leetcode-cn.com/problems/predict-the-winner/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/PredictTheWinner.java)|100.00% 5.45%|Minimax|
|0518|[coin-change-2](https://leetcode.com/problems/coin-change-2/)|[coin-change-2](https://leetcode-cn.com/problems/coin-change-2/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/CoinChangeII.java)|100.00% 8.33%|Dynamic Programming|
|0714|[best-time-to-buy-and-sell-stock-with-transaction-fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)|[best-time-to-buy-and-sell-stock-with-transaction-fee](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/BestTimeToBuyAndSellStockWithTransactionFee.java)|80.67% 100.00%|Dynamic Programming|
|0746|[min-cost-climbing-stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)|[min-cost-climbing-stairs](https://leetcode-cn.com/problems/min-cost-climbing-stairs/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/MinCostClimbingStairs.java)|99.86% 100.00%|Dynamic Programming|
|0877|[stone-game](https://leetcode.com/problems/stone-game/)|[stone-game](https://leetcode-cn.com/problems/stone-game/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/StoneGame.java)|100.00% 100.00%|Minimax|
|0931|[minimum-falling-path-sum](https://leetcode.com/problems/minimum-falling-path-sum/)|[minimum-falling-path-sum](https://leetcode-cn.com/problems/minimum-falling-path-sum/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/MinimumFallingPathSum.java)|89.09% 86.67%|Dynamic Programming|
|1025|[divisor-game](https://leetcode.com/problems/divisor-game/)|[divisor-game](https://leetcode-cn.com/problems/divisor-game/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/DivisorGame.java)|100.00% 13.33%|Dynamic Programming|
|1140|[stone-game-ii](https://leetcode.com/problems/stone-game-ii/)|[stone-game-ii](https://leetcode-cn.com/problems/stone-game-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/StoneGameII.java)|100.00% 100.00%|Minimax|
|1449|[form-largest-integer-with-digits-that-add-up-to-target](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target/)|[form-largest-integer-with-digits-that-add-up-to-target](https://leetcode-cn.com/problems/form-largest-integer-with-digits-that-add-up-to-target/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/FormLargestIntegerWithDigitsThatAddUpToTarget.java)|100.00% 100.00%|Dynamic Programming|

### Binary Tree
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0100|[same-tree](https://leetcode.com/problems/same-tree/)|[same-tree](https://leetcode-cn.com/problems/same-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SameTree.java)|100.00% 0ms 5.33%|Binary Tree|
|0101|[symmetric-tree](https://leetcode.com/problems/symmetric-tree/)|[symmetric-tree](https://leetcode-cn.com/problems/symmetric-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SymmetricTree.java)|100.00% 26.66%|Binary Tree|
|0104|[maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/MaximumDepthOfBinaryTree.java)|100.00% 25.42%|Binary Tree|
|0105|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/ConstructBinaryTreeFromPreorderAndInorderTraversal.java)|77.57% 70.00%|Binary Tree|
|0106|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/ConstructBinaryTreefromInorderAndPostorderTraversal.java)|74.17% 61.90%|Binary Tree|
|0110|[balanced-binary-tree](https://leetcode.com/problems/balanced-binary-tree/)|[balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/BalancedBinaryTree.java)|99.69% 1ms 23.53%|Binary Tree|
|0116|[populating-next-right-pointers-in-each-node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)|[populating-next-right-pointers-in-each-node](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/PopulatingNextRightPointersInEachNode.java)|100% 100%|Binary Tree|
|0117|[populating-next-right-pointers-in-each-node-ii](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|[populating-next-right-pointers-in-each-node-ii](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/PopulatingNextRightPointersInEachNodeII.java)|45.96% 50.00%|Binary Tree|
|0226|[invert-binary-tree](https://leetcode.com/problems/invert-binary-tree/)|[invert-binary-tree](https://leetcode-cn.com/problems/invert-binary-tree/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/InvertBinaryTree.java)|100.00% 48.73%|Binary Tree|
|0236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/LowestCommonAncestorOfABinaryTree.java)|100.00% 44.21%|Binary Tree|
|0236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/AllNodesDistanceKInBinaryTree.java)|100% 19.83%|Binary Tree|
|0297|[serialize-and-deserialize-binary-tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)|[serialize-and-deserialize-binary-tree](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SerializeAndDeserializeBinaryTree.java)|26.24% 33.57%|Binary Tree|
|0404|[sum-of-left-leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[sum-of-left-leaves](https://leetcode-cn.com/problems/sum-of-left-leaves/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SumOfLeftLeaves.java)|100.00% 88.90%|Binary Tree|
|0543|[diameter-of-binary-tree](https://leetcode.com/problems/diameter-of-binary-tree/)|[diameter-of-binary-tree](https://leetcode-cn.com/problems/diameter-of-binary-tree/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/DiameterOfBinaryTree.java)|100.00% 23.72%|tree.binarytree|
|0563|[binary-tree-tilt](https://leetcode.com/problems/binary-tree-tilt/)|[binary-tree-tilt](https://leetcode-cn.com/problems/binary-tree-tilt/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/BinaryTreeTilt.java)|100.00% 31.25%|tree.binarytree|
|0617|[merge-two-binary-trees](https://leetcode.com/problems/merge-two-binary-trees/)|[merge-two-binary-trees](https://leetcode-cn.com/problems/merge-two-binary-trees/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/MergeTwoBinaryTrees.java)|100.00% 17.28%|Binary Tree|
|0671|[second-minimum-node-in-a-binary-tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/)|[second-minimum-node-in-a-binary-tree](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SecondMinimumNodeInABinaryTree.java)|100.00% 93.19%|Binary Tree|

### Linked List
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|Offer22|[lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof](https://leetcode.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/)|[lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof](https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/KthFromEnd.java)|100.00% 85.78%|Double Pointers|
|0002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)|[add-two-numbers](https://leetcode-cn.com/problems/add-two-numbers/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/AddTwoNumbers.java)|94.51% 90.73%|Linked list|
|0024|[swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[swap-nodes-in-pairs](https://leetcode-cn.com/problems/swap-nodes-in-pairs/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/SwapNodesInPairs.java)|100% 55.56%|Linked List|
|0025|[reverse-nodes-in-k-group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[reverse-nodes-in-k-group](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/ReverseNodesInKGroup.java)|100.00% 37.77%|Linked List|
|0083|[remove-duplicates-from-sorted-list](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[remove-duplicates-from-sorted-list](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/RemoveDuplicatesFromSortedList.java)|100.00% 99.97%|Linked list|
|0092|[reverse-linked-list-ii](https://leetcode.com/problems/reverse-linked-list-ii/)|[reverse-linked-list-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/ReverseLinkedListII.java)|100.00% 100.00%|Linked list|
|0109|[convert-sorted-list-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)|[convert-sorted-list-to-binary-search-tree](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/ConvertSortedListToBinarySearchTree.java)|97.35% 100.00%|Linked list , Binary Tree|
|0142|[linked-list-cycle-ii](https://leetcode.com/problems/linked-list-cycle-ii/)|[linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/PalindromeLinkedList.java)|96.51% 99.89%|Linked list|
|0160|[intersection-of-two-linked-lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)|[intersection-of-two-linked-lists](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/IntersectionOfTwoLinkedLists.java)|100.00%  22.65%|Linked list|
|0203|[remove-linked-list-elements](https://leetcode.com/problems/remove-linked-list-elements/)|[remove-linked-list-elements](https://leetcode-cn.com/problems/remove-linked-list-elements/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/RemoveLinkedListElements.java)|99.37% 99.72%|Linked list|
|0206|[reverse-linked-list](https://leetcode.com/problems/reverse-linked-list/)|[reverse-linked-list](https://leetcode-cn.com/problems/reverse-linked-list/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/ReverseLinkedList.java)|100.00% 99.87%|Double Pointers, Recursive|
|0237|[delete-node-in-a-linked-list](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[delete-node-in-a-linked-list](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/DeleteNodeInALinkedList.java)|100% 100%|Linked list|
|0328|[odd-even-linked-list](https://leetcode.com/problems/odd-even-linked-list/)|[odd-even-linked-list](https://leetcode-cn.com/problems/odd-even-linked-list/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/OddEvenLinkedList.java)|100.00% 8.12%|Linked List|
|0445|[add-two-numbers-ii](https://leetcode.com/problems/add-two-numbers-ii/)|[add-two-numbers-ii](https://leetcode-cn.com/problems/add-two-numbers-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/AddTwoNumbersII.java)|99.96% 74.91%|Linked list|
|0707|[design-linked-list](https://leetcode.com/problems/design-linked-list/)|[design-linked-list](https://leetcode-cn.com/problems/design-linked-list/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/MyLinkedList.java)|80.06% 88.98%|Linked list|
|0725|[split-linked-list-in-parts](https://leetcode.com/problems/split-linked-list-in-parts/)|[split-linked-list-in-parts](https://leetcode-cn.com/problems/split-linked-list-in-parts/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/SplitLinkedListInParts.java)|100.00%  100.00%|Linked list|
|0876|[middle-of-the-linked-list](https://leetcode.com/problems/middle-of-the-linked-list/)|[middle-of-the-linked-list](https://leetcode-cn.com/problems/middle-of-the-linked-list/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/linkedlist/MiddleOfTheLinkedList.java)|100.00% 100.00%|Linked list|

### Permutation & Combination
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0031|[next-permutation](https://leetcode.com/problems/next-permutation/)|[next-permutation](https://leetcode-cn.com/problems/next-permutation/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/NextPermutation.java)|100% 66%|Greedy|
|0039|[combination-sum](https://leetcode.com/problems/combination-sum/)|[combination-sum](https://leetcode-cn.com/problems/combination-sum/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/CombinationSum.java)|77.47% 86.63%|combination|
|0040|[combination-sum-ii](https://leetcode.com/problems/combination-sum-ii/)|[combination-sum-ii](https://leetcode-cn.com/problems/combination-sum-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/CombinationSumII.java)|40.55% 53.43%|combination|
|0046|[permutations](https://leetcode.com/problems/permutations/)|[permutations](https://leetcode-cn.com/problems/permutations/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/Permutations.java)|96.75% 5.14%|Backtracking|
|0047|[permutations-ii](https://leetcode.com/problems/permutations-ii/)|[permutations-ii](https://leetcode-cn.com/problems/permutations-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/PermutationsII.java)|100.00% 17.50%|Backtracking|
|0077|[combinations](https://leetcode.com/problems/combinations/)|[combinations](https://leetcode-cn.com/problems/combinations/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/Combinations.java)|93.17% 74.09%|Backtracking|
|0078|[subsets](https://leetcode.com/problems/subsets/)|[subsets](https://leetcode-cn.com/problems/subsets/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/Subsets.java)|82.14% 5.24%|combination|
|0090|[subsets-ii](https://leetcode.com/problems/subsets-ii/)|[subsets-ii](https://leetcode-cn.com/problems/subsets-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/SubsetsII.java)|100.00% 24.48%|combination|
|lcof38|[zi-fu-chuan-de-pai-lie-lcof](https://leetcode.com/problems/zi-fu-chuan-de-pai-lie-lcof/)|[zi-fu-chuan-de-pai-lie-lcof](https://leetcode-cn.com/problems/zi-fu-chuan-de-pai-lie-lcof/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/StringPermutation.java)|99.28% 49.61%|Backtracking|
|0060|[permutation-sequence](https://leetcode.com/problems/permutation-sequence/)|[permutation-sequence](https://leetcode-cn.com/problems/permutation-sequence/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/PermutationSequence.java)|57.64% 43.94%|Math|
|0216|[combination-sum-iii](https://leetcode.com/problems/combination-sum-iii/)|[combination-sum-iii](https://leetcode-cn.com/problems/combination-sum-iii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/CombinationSumIII.java)|46.43% 42.73%|Backtracking|
|0377|[combination-sum-iv](https://leetcode.com/problems/combination-sum-iv/)|[combination-sum-iv](https://leetcode-cn.com/problems/combination-sum-iv/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/CombinationSumIV.java)|99.56% 51.40%|DP|
|0567|[permutation-in-string](https://leetcode.com/problems/permutation-in-string/)|[permutation-in-string](https://leetcode-cn.com/problems/permutation-in-string/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/PermutationInString.java)|58.10% 18.75%|Sliding Window|
|0784|[letter-case-permutation](https://leetcode.com/problems/letter-case-permutation/)|[letter-case-permutation](https://leetcode-cn.com/problems/letter-case-permutation/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/permutationcombination/LetterCasePermutation.java)|100.00% 99.36%|Backtracking|

### Binary Search
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0004|[median-of-two-sorted-array](https://leetcode.com/problems/median-of-two-sorted-arrays)|[median-of-two-sorted-array](https://leetcode-cn.com/problems/median-of-two-sorted-arrays)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/MedianOfTwoSortedArrays.java)|92.12% 84.77%|Binary Search|
|0035|[search-insert-position](https://leetcode.com/problems/search-insert-position/)|[search-insert-position](https://leetcode-cn.com/problems/search-insert-position/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/SearchInsertPosition.java)|100.00% 5.03%|Binary Search|
|0050|[powx-n](https://leetcode.com/problems/powx-n/)|[powx-n](https://leetcode-cn.com/problems/powx-n/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/PowXN.java)|82.1 100%|Binary Search|
|0069|[sqrtx](https://leetcode.com/problems/sqrtx/)|[sqrtx](https://leetcode-cn.com/problems/sqrtx/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/SqrtX.java)|100.00% 5.04%|Binary Search|
|0153|[find-minimum-in-rotated-sorted-array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[find-minimum-in-rotated-sorted-array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/)|medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/FindMinimumInRotatedSortedArray.java)|100.00% 29.57%|Binary Search|
|0154|[find-minimum-in-rotated-sorted-array-ii](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)|[find-minimum-in-rotated-sorted-array-ii](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/FindMinimumInRotatedSortedArrayII.java)|100.00% 29.57%|Binary Search|
|0167|[two-sum-ii-input-array-is-sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|[two-sum-ii-input-array-is-sorted](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/TwoSumIIInputArrayIsSorted.java)|100.00% 63.39%|Binary Search|
|0222|[count-complete-tree-nodes](https://leetcode.com/problems/count-complete-tree-nodes/)|[count-complete-tree-nodes](https://leetcode-cn.com/problems/count-complete-tree-nodes/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/CountCompleteTreeNodes.java)|100.00% 53.27%|Binary Search|
|0300|[longest-increasing-subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[longest-increasing-subsequence](https://leetcode-cn.com/problems/longest-increasing-subsequence/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/LongestIncreasingSubsequence.java)|94.63% 5.63%|Binary Search ,Dynamic Programming|
|0374|[guess-number-higher-or-lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[guess-number-higher-or-lower](https://leetcode-cn.com/problems/guess-number-higher-or-lower/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/GuessNumberHigherOrLower.java)|100.00% 5.21%|Binary Search|
|0441|[arranging-coins](https://leetcode.com/problems/arranging-coins/)|[arranging-coins](https://leetcode-cn.com/problems/arranging-coins/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/ArrangingCoins.java)|82.04% 100%|Binary Search|
|0704|[binary-search](https://leetcode.com/problems/binary-search/)|[binary-search](https://leetcode-cn.com/problems/binary-search/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/BinarySearch.java)|100.00% 5.09%|Binary Search|
|0852|[peak-index-in-a-mountain-array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)|[peak-index-in-a-mountain-array](https://leetcode-cn.com/problems/peak-index-in-a-mountain-array/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/PeakIndexInAMountainArray.java)|100.00% 5.16%|Binary Search|
|0875|[koko-eating-bananas](https://leetcode.com/problems/koko-eating-bananas/)|[koko-eating-bananas](https://leetcode-cn.com/problems/koko-eating-bananas/)|medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/binarysearch/KokoEatingBananas.java)|67.13% 5.14%|Binary Search|

### Stack
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0020|[valid-parentheses](https://leetcode.com/problems/valid-parentheses/)|[valid-parentheses](https://leetcode-cn.com/problems/valid-parentheses/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/ValidParentheses.java)|98.69% 99.98%|Stack|
|0032|[longest-valid-parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[longest-valid-parentheses](https://leetcode-cn.com/problems/longest-valid-parentheses/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/LongestValidParentheses.java)|98.69% 99.98%|Stack|
|0155|[min-stack](https://leetcode.com/problems/min-stack/)|[min-stack](https://leetcode-cn.com/problems/min-stack/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/MinStack.java)|78.13% 14.46%|Design|
|0225|[implement-stack-using-queues](https://leetcode.com/problems/implement-stack-using-queues/)|[implement-stack-using-queues](https://leetcode-cn.com/problems/implement-stack-using-queues/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/MyStack.java)|100% 100%|Stack, Queue|
|0394|[decode-string](https://leetcode.com/problems/decode-string/)|[decode-string](https://leetcode-cn.com/problems/decode-string/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/DecodeString.java)|100.00% 100.00%|Stack,String|
|0772|[basic-calculator-iii](https://leetcode.com/problems/basic-calculator-iii/)|[basic-calculator-iii](https://leetcode-cn.com/problems/basic-calculator-iii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/BasicCalculatorIII.java)|46.17% 20.92%|Stack|
|mst03.01|[three-in-one-lcci](https://leetcode.com/problems/three-in-one-lcci/)|[three-in-one-lcci](https://leetcode-cn.com/problems/three-in-one-lcci/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/ThreeInOneLCCI.java)|91.52% 5.64%|Stack|
|mst03.05|[sort-of-stacks-lcci](https://leetcode.com/problems/sort-of-stacks-lcci/)|[sort-of-stacks-lcci](https://leetcode-cn.com/problems/sort-of-stacks-lcci/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/SortOfStacksLCCI.java)|99.82% 10.49%|Stack|
|1047|[remove-all-adjacent-duplicates-in-string](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)|[remove-all-adjacent-duplicates-in-string](https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/RemoveAllAdjacentDuplicatesInString.java)|100.00% 16.48%|Stack|
|946,Offer31|[zhan-de-ya-ru-dan-chu-xu-lie-lcof](https://leetcode.com/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/)|[zhan-de-ya-ru-dan-chu-xu-lie-lcof](https://leetcode-cn.com/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/ValidateStackSequences.java)|96.92% 10.81%|Stack|
|227,mst16.26|[basic-calculator-ii](https://leetcode.com/problems/basic-calculator-ii/)|[basic-calculator-ii](https://leetcode-cn.com/problems/basic-calculator-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/BasicCalculatorII.java)|100% 23%|Stack|
|0224|[basic-calculator](https://leetcode.com/problems/basic-calculator/)|[basic-calculator](https://leetcode-cn.com/problems/basic-calculator/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/BasicCalculator.java)|43.08% 17.47%|Stack|
|0739|[daily-temperatures](https://leetcode.com/problems/daily-temperatures/)|[daily-temperatures](https://leetcode-cn.com/problems/daily-temperatures/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stack/DailyTemperatures.java)|91.69% 5.03%|Stack|

### Math
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|mst16.11|[diving-board-lcci](https://leetcode.com/problems/diving-board-lcci/)|[diving-board-lcci](https://leetcode-cn.com/problems/diving-board-lcci/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/DivingBoardLCCI.java)|100% 100%|Math|
|Offer62|[yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof](https://leetcode.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/)|[yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof](https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/offer62.java)|99.98% 100.00%|Math|
|0007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)|[reverse-integer](https://leetcode-cn.com/problems/reverse-integer/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/ReverseInteger.java)|100.00% 11.11%|Math|
|0029|[divide-two-integers](https://leetcode.com/problems/divide-two-integers/)|[divide-two-integers](https://leetcode-cn.com/problems/divide-two-integers/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/DivideTwoIntegers.java)|88% 49%|Math|
|0168|[excel-sheet-column-title](https://leetcode.com/problems/excel-sheet-column-title/)|[excel-sheet-column-title](https://leetcode-cn.com/problems/excel-sheet-column-title/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/ExcelSheetColumnTitle.java)|100.00% 14.29%|Math|
|0171|[excel-sheet-column-number](https://leetcode.com/problems/excel-sheet-column-number/)|[excel-sheet-column-number](https://leetcode-cn.com/problems/excel-sheet-column-number/)|Easy -|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/ExcelSheetColumnNumber.java)|100.00% 5.55%|Math|
|0172|[factorial-trailing-zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)|[factorial-trailing-zeroes](https://leetcode-cn.com/problems/factorial-trailing-zeroes/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/FactorialTrailingZeroes.java)|100.00% 100.00%|Math|
|0202|[happy-number](https://leetcode.com/problems/happy-number/)|[happy-number](https://leetcode-cn.com/problems/happy-number/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/HappyNumber.java)|47.92% 8.33%|Math|
|0204|[count-primes](https://leetcode.com/problems/count-primes/)|[count-primes](https://leetcode-cn.com/problems/count-primes/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/CountPrime.java)|80% 80%|Math|
|0223|[rectangle-area](https://leetcode.com/problems/rectangle-area/)|[rectangle-area](https://leetcode-cn.com/problems/rectangle-area/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/RectangleArea.java)|98.16% 25.00%|Math|
|0365|[water-and-jug-problem](https://leetcode.com/problems/water-and-jug-problem/)|[water-and-jug-problem](https://leetcode-cn.com/problems/water-and-jug-problem/)|Medium +|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/WaterAndJugProblem.java)|100.00% 13.93%|Math, BFS|
|0492|[construct-the-rectangle](https://leetcode.com/problems/construct-the-rectangle/)|[construct-the-rectangle](https://leetcode-cn.com/problems/construct-the-rectangle/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/ConstructTheRectangle.java)|100.00% 14.29%|Math|
|0836|[rectangle-overlap](https://leetcode.com/problems/rectangle-overlap/)|[rectangle-overlap](https://leetcode-cn.com/problems/rectangle-overlap/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/RectangleOverlap.java)|100.00% 50.00%|Math|
|1071|[greatest-common-divisor-of-strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[greatest-common-divisor-of-strings](https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/gcd/GreatestCommonDivisorOfStrings.java)|97.81% 100.00%|Greatest Common Divisor|

### Matrix
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|mst01.08|[zero-matrix-lcci](https://leetcode.com/problems/zero-matrix-lcci/)|[zero-matrix-lcci](https://leetcode-cn.com/problems/zero-matrix-lcci/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/ZeroMatrixLCCI.java)|50% 50%|Matrix|
|0054|[spiral-matrix](https://leetcode.com/problems/spiral-matrix/)|[spiral-matrix](https://leetcode-cn.com/problems/spiral-matrix/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/SpiralMatrix.java)|100.00% 99.54%|Matrix|
|0200|[number-of-islands](https://leetcode.com/problems/number-of-islands/)|[number-of-islands](https://leetcode-cn.com/problems/number-of-islands/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/NumberOfIslands.java)|91.40% 15.30%|dfs|
|0240|[search-a-2d-matrix-ii](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[search-a-2d-matrix-ii](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/SearchA2DMatrixII.java)|97.85% 17.32%|Matrix|
|0289|[game-of-life](https://leetcode.com/problems/game-of-life/)|[game-of-life](https://leetcode-cn.com/problems/game-of-life/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/GameOfLife.java)|100.00% 91.85%|Matrix|
|0695|[max-area-of-island](https://leetcode.com/problems/max-area-of-island/)|[max-area-of-island](https://leetcode-cn.com/problems/max-area-of-island/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/MaxAreaOfIsland.java)|82.11% 91.14%|Matrix, Back tracking|
|0766|[toeplitz-matrix](https://leetcode.com/problems/toeplitz-matrix/)|[toeplitz-matrix](https://leetcode-cn.com/problems/toeplitz-matrix/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/ToeplitzMatrix.java)|100.00% 73.60%|Matrix|
|0832|[flipping-an-image](https://leetcode.com/problems/flipping-an-image/)|[flipping-an-image](https://leetcode-cn.com/problems/flipping-an-image/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/FlippingAnImage.java)|100.00% 99.95%|Matrix|
|0867|[transpose-matri](https://leetcode.com/problems/transpose-matrix)|[transpose-matri](https://leetcode-cn.com/problems/transpose-matrix)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/TransposeMatrix.java)|100.00% 99.81%|Matrix|
|0985|[reshape-the-matrix](https://leetcode.com/problems/reshape-the-matrix/)|[reshape-the-matrix](https://leetcode-cn.com/problems/reshape-the-matrix/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/ReshapeTheMatrix.java)|100.00% 100.00%|Matrix|
|0999|[available-captures-for-rook](https://leetcode.com/problems/available-captures-for-rook/)|[available-captures-for-rook](https://leetcode-cn.com/problems/available-captures-for-rook/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/matrix/AvailableCapturesForRook.java)|100.00% 99.95%|Matrix|

### Two Pointers
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[longest-substring-without-repeating-characters](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/slidingwindow/LongestSubstringWithoutRepeatingCharacters.java)|99.83% 80.19%|Sliding Window|
|0011|[container-with-most-water](https://leetcode.com/problems/container-with-most-water/)|[container-with-most-water](https://leetcode-cn.com/problems/container-with-most-water/)|medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/ContainerWithMostWater.java)|71.02% 7.14%|Two Pointers|
|0015|[3sum](https://leetcode.com/problems/3sum/)|[3sum](https://leetcode-cn.com/problems/3sum/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/ThreeSum.java)|98.79% 91.35%|Two Pointers|
|0016|[3sum-closest](https://leetcode.com/problems/3sum-closest/)|[3sum-closest](https://leetcode-cn.com/problems/3sum-closest/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/ThreeSumClosest.java)|85.38% 17.73%|Two Pointers|
|0018|[4sum](https://leetcode.com/problems/4sum/)|[4sum](https://leetcode-cn.com/problems/4sum/)|medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/Foursum.java)|88.88% 68.14%|Two Pointers|
|0019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[remove-nth-node-from-end-of-list](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/fastslowpointers/RemoveNthNodeFromEndOfList.java)|100.00% 94.24%|Two Pointers|
|0026|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[remove-duplicates-from-sorted-array](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/RemoveDuplicatesFromSortedArray.java)|100% 99.47%|Array|
|0027|[remove-element](https://leetcode.com/problems/remove-element/)|[remove-element](https://leetcode-cn.com/problems/remove-element/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/RemoveElement.java)|100.00% 100.00%|Array|
|0042|[trapping-rain-water](https://leetcode.com/problems/trapping-rain-water/)|[trapping-rain-water](https://leetcode-cn.com/problems/trapping-rain-water/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/TrappingRainWater.java)|99.95% 19.88%|two pointers|
|0076|[minimum-window-substring](https://leetcode.com/problems/minimum-window-substring/)|[minimum-window-substring](https://leetcode-cn.com/problems/minimum-window-substring/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/slidingwindow/MinimumWindowSubstring.java)|42.34% 13.33%|Sliding Window|
|0088|[merge-sorted-array](https://leetcode.com/problems/merge-sorted-array/)|[merge-sorted-array](https://leetcode-cn.com/problems/merge-sorted-array/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/MergSortedArray.java)|100.00% 73.09%|Two Pointers|
|0141|[linked-list-cycle](https://leetcode.com/problems/linked-list-cycle/)|[linked-list-cycle](https://leetcode-cn.com/problems/linked-list-cycle/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/LinkedListCycle.java)|100.00%  99.88%|Two Pointers|
|0142|[linked-list-cycle-ii](https://leetcode.com/problems/linked-list-cycle-ii/)|[linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/LinkedListCycleII.java)|100.00% 5.04%|Two Pointers|
|0239|[sliding-window-maximum](https://leetcode.com/problems/sliding-window-maximum/)|[sliding-window-maximum](https://leetcode-cn.com/problems/sliding-window-maximum/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/slidingwindow/SlidingWindowMaximum.java)|39.53% 6.67%|Sliding Window|
|0424|[longest-repeating-character-replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)|[longest-repeating-character-replacement](https://leetcode-cn.com/problems/longest-repeating-character-replacement/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/slidingwindow/LongestRepeatingCharacterReplacement.java)|33.67% 100.00%|Sliding Window|

### Binary Search Tree
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

### Hashtable
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0219|[contains-duplicate-ii](https://leetcode.com/problems/contains-duplicate-ii/)|[contains-duplicate-ii](https://leetcode-cn.com/problems/contains-duplicate-ii/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/ContainsDuplicateII.java)|95.81% 5.72%|Hashtable|
|0242|[valid-anagram](https://leetcode.com/problems/valid-anagram/)|[valid-anagram](https://leetcode-cn.com/problems/valid-anagram/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/ValidAnagram.java)|90.46% 71.14%|Hashtable|
|0389|[find-the-difference](https://leetcode.com/problems/find-the-difference/)|[find-the-difference](https://leetcode-cn.com/problems/find-the-difference/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/FindTheDifference.java)|99.37% 19.48%|Hashtable|
|0409|[longest-palindrome](https://leetcode.com/problems/longest-palindrome/)|[longest-palindrome](https://leetcode-cn.com/problems/longest-palindrome/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/LongestPalindrome.java)|100.00% 100%|Hashtable|
|0454|[4sum-ii](https://leetcode.com/problems/4sum-ii/)|[4sum-ii](https://leetcode-cn.com/problems/4sum-ii/)|medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/FoursumII.java)|99.35% 53.32%|Two Pointers|
|0594|[longest-harmonious-subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)|[longest-harmonious-subsequence](https://leetcode-cn.com/problems/longest-harmonious-subsequence/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/LongestHarmoniousSubsequence.java)|100.00% 13.99%|Hashtable|
|0692|[top-k-frequent-words](https://leetcode.com/problems/top-k-frequent-words/)|[top-k-frequent-words](https://leetcode-cn.com/problems/top-k-frequent-words/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/TopKFrequentWords.java)|99.50%  89.29%|Hashtable|
|1160|[find-words-that-can-be-formed-by-characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[find-words-that-can-be-formed-by-characters](https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashtable/FindWordsThatCanBeFormedbyCharacters.java)|84.18% 5.08%|Hashtable|

### String
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0008|[string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi/)|[string-to-integer-atoi](https://leetcode-cn.com/problems/string-to-integer-atoi/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/Atoi.java)|99.87% 93.46%|String|
|0014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)|[longest-common-prefix](https://leetcode-cn.com/problems/longest-common-prefix/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/LongestCommonPrefix.java)|74.35% 100%|String|
|0038|[count-and-say](https://leetcode.com/problems/count-and-say/)|[count-and-say](https://leetcode-cn.com/problems/count-and-say/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/CountAndSay.java)|100 % 100 %|String|
|0058|[length-of-last-word](https://leetcode.com/problems/length-of-last-word/)|[length-of-last-word](https://leetcode-cn.com/problems/length-of-last-word/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/LengthOfLastWord.java)|100.00% 5.32%|String|
|0067|[add-binary](https://leetcode.com/problems/add-binary/)|[add-binary](https://leetcode-cn.com/problems/add-binary/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/AddBinary.java)|97.15% 5.12%|String|
|0205|[isomorphic-strings](https://leetcode.com/problems/isomorphic-strings/)|[isomorphic-strings](https://leetcode-cn.com/problems/isomorphic-strings/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/IsomorphicStrings.java)|81.95% 34.68%|String|
|0344|[reverse-string](https://leetcode.com/problems/reverse-string/)|[reverse-string](https://leetcode-cn.com/problems/reverse-string/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/ReverseString.java)|100.00% 18.74%|String|
|0415|[add-strings](https://leetcode.com/problems/add-strings/)|[add-strings](https://leetcode-cn.com/problems/add-strings/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/AddStrings.java)|99.62% 26.75%|Math|
|0541|[reverse-string-ii](https://leetcode.com/problems/reverse-string-ii/)|[reverse-string-ii](https://leetcode-cn.com/problems/reverse-string-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/string/ReverseStringII.java)|100.00% 25.50%|String|

### Palindromic
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0005|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring/)|[longest-palindromic-substring](https://leetcode-cn.com/problems/longest-palindromic-substring/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/LongestPalindromicSubstring.java)|87.40% 69.11%|String|
|0009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)|[palindrome-number](https://leetcode-cn.com/problems/palindrome-number/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromeNumber.java)|100.00% 5.02%|Math|
|0125|[valid-palindrome](https://leetcode.com/problems/valid-palindrome/)|[valid-palindrome](https://leetcode-cn.com/problems/valid-palindrome/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/ValidPalindrome.java)|100% 100%|String|
|0234|[palindrome-linked-list](https://leetcode.com/problems/palindrome-linked-list/)|[palindrome-linked-list](https://leetcode-cn.com/problems/palindrome-linked-list/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromeLinkedList.java)|99.87% 7.54%|findpattern.palindromic|
|0516|[longest-palindromic-subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)|[longest-palindromic-subsequence](https://leetcode-cn.com/problems/longest-palindromic-subsequence/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/LongestPalindromicSubsequence.java)|100% 100%|Dynamic Programming|
|0647|[palindromic-substrings](https://leetcode.com/problems/palindromic-substrings/)|[palindromic-substrings](https://leetcode-cn.com/problems/palindromic-substrings/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromicSubstrings.java)|99.97% 100.00%|Dynamic Programming|
|0680|[valid-palindrome-ii](https://leetcode.com/problems/valid-palindrome-ii/)|[valid-palindrome-ii](https://leetcode-cn.com/problems/valid-palindrome-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/ValidPalindromeII.java)|99.68% 94.44%|String|

### Breadth-first Search
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0102|[binary-tree-level-order-traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/BinaryTreeLevelOrderTraversal.java)|99.79% 5.13%|Breadth First Search|
|0103|[binary-tree-zigzag-level-order-traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)|[binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/BinaryTreeZigzagLevelOrderTraversal.java)|98.10% 34.57%|Breadth First Search|
|0107|[binary-tree-level-order-traversal-ii](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)|[binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/BinaryTreeLevelOrderTraversalI.java)|99.79% 5.13%|Breadth First Search|
|0111|[minimum-depth-of-binary-tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)|[minimum-depth-of-binary-tree](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/MinimumDepthOfBinaryTree.java)|100.00% 5.33%|Breadth First Search|
|0199|[binary-tree-right-side-view](https://leetcode.com/problems/binary-tree-right-side-view/)|[binary-tree-right-side-view](https://leetcode-cn.com/problems/binary-tree-right-side-view/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/BinaryTreeRightSideView.java)|95.83% 16.21%|Breadth First Search|
|0637|[average-of-levels-in-binary-tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)|[average-of-levels-in-binary-tree](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/AverageOfLevelsInBinaryTree.java)|99.18% 24.76%|Breadth First Search|
|0752|[open-the-lock](https://leetcode.com/problems/open-the-lock/)|[open-the-lock](https://leetcode-cn.com/problems/open-the-lock/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/breadthfirstsearch/OpenTheLock.java)|100% 83.33%|Breadth First Search|

### Bit Manipulation
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0136|[single-number](https://leetcode.com/problems/single-number/)|[single-number](https://leetcode-cn.com/problems/single-number/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/SingleNumber.java)|100% 100%|Bit Manipulation|
|0137|[single-number-ii](https://leetcode.com/problems/single-number-ii/)|[single-number-ii](https://leetcode-cn.com/problems/single-number-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/SingleNumberII.java)|100% 100%|Bit Manipulation|
|0190|[reverse-bits](https://leetcode.com/problems/reverse-bits/)|[reverse-bits](https://leetcode-cn.com/problems/reverse-bits/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/ReverseBits.java)|100.00% 92.12%|Bit Manipulation|
|0191|[number-of-1-bits](https://leetcode.com/problems/number-of-1-bits/)|[number-of-1-bits](https://leetcode-cn.com/problems/number-of-1-bits/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/NumberOf1Bits.java)|100% 100%|Bit Manipulation|
|0260|[single-number-iii](https://leetcode.com/problems/single-number-iii/)|[single-number-iii](https://leetcode-cn.com/problems/single-number-iii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/SingleNumberIII.java)|100% 16.67%|Bit Manipulation|
|0371|[sum-of-two-integers](https://leetcode.com/problems/sum-of-two-integers/)|[sum-of-two-integers](https://leetcode-cn.com/problems/sum-of-two-integers/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/SumOfTwoIntegers.java)|100% 8.00%|Bit Manipulation|
|0397|[integer-replacement](https://leetcode.com/problems/integer-replacement/)|[integer-replacement](https://leetcode-cn.com/problems/integer-replacement/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/bitmanipulation/IntegerReplacement.java)|100% 8.00%|Bit Manipulation|

### Backtracking
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0017|[letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[letter-combinations-of-a-phone-number](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/LetterCombinationsOfAPhoneNumber.java)|100.00% 84.17%|Backtracking|
|0037|[sudoku-solver](https://leetcode.com/problems/sudoku-solver/)|[sudoku-solver](https://leetcode-cn.com/problems/sudoku-solver/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/SudokuSolver.java)|97.00% 94.25%|Backtracking|
|0051|[n-queens](https://leetcode.com/problems/n-queens/)|[n-queens](https://leetcode-cn.com/problems/n-queens/)|Hard-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/NQueens.java)|100% 100%|Backtracking|
|0079|[word-search](https://leetcode.com/problems/word-search/)|[word-search](https://leetcode-cn.com/problems/word-search/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/WordSearch.java)|99.91% 100.00%|Backtracking|
|0212|[word-search-ii](https://leetcode.com/problems/word-search-ii/)|[word-search-ii](https://leetcode-cn.com/problems/word-search-ii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/WordSearchII.java)|99.98% 77.78%|Backtracking|
|0679|[24-game](https://leetcode.com/problems/24-game/)|[24-game](https://leetcode-cn.com/problems/24-game/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/TwentyFourGame.java)|93.33% 14.29%|Backtracking|
|0784|[letter-case-permutation](https://leetcode.com/problems/letter-case-permutation/)|[letter-case-permutation](https://leetcode-cn.com/problems/letter-case-permutation/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/backtracking/BinaryWatch.java)|89.19% 100.00%|Backtracking|

### Trie
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0139|[word-break](https://leetcode.com/problems/word-break/)|[word-break](https://leetcode-cn.com/problems/word-break/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/WordBreak.java)|99.62% 77.20%|tree.trie|
|0140|[word-break-ii](https://leetcode.com/problems/word-break-ii/)|[word-break-ii](https://leetcode-cn.com/problems/word-break-ii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/WordBreakII.java)|100.00% 92.20%|tree.trie|
|0208|[implement-trie-prefix-tree](https://leetcode.com/problems/implement-trie-prefix-tree/)|[implement-trie-prefix-tree](https://leetcode-cn.com/problems/implement-trie-prefix-tree/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/ImplementTriePrefixTree.java)|99.79% 98.24%|Trie|
|0211|[design-add-and-search-words-data-structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)|[design-add-and-search-words-data-structure](https://leetcode-cn.com/problems/design-add-and-search-words-data-structure/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/DesignAddAndSearchWordsDataStructure.java)|100.00% 76.32%|Trie|
|0720|[longest-word-in-dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)|[longest-word-in-dictionary](https://leetcode-cn.com/problems/longest-word-in-dictionary/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/LongestWordInDictionary.java)|100.00% 97.61%|Trie|
|1023|[camelcase-matching](https://leetcode.com/problems/camelcase-matching/)|[camelcase-matching](https://leetcode-cn.com/problems/camelcase-matching/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/CamelcaseMatching.java)|100.00% 99.58%|Trie|

### Find Pattern
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|mst01.05|[one-away-lcci](https://leetcode.com/problems/one-away-lcci/)|[one-away-lcci](https://leetcode-cn.com/problems/one-away-lcci/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/OneAwayLCCI.java)|100.00% 5.04%|Find Pattern|
|0005|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring/)|[longest-palindromic-substring](https://leetcode-cn.com/problems/longest-palindromic-substring/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/LongestPalindromicSubstring.java)|87.40% 69.11%|String|
|0006|[zigzag-conversion](https://leetcode.com/problems/zigzag-conversion/)|[zigzag-conversion](https://leetcode-cn.com/problems/zigzag-conversion/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/ZigZagConversion.java)|99.87% 93.46%|String|
|0009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)|[palindrome-number](https://leetcode-cn.com/problems/palindrome-number/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromeNumber.java)|100.00% 5.02%|Math|
|0022|[generate-parentheses](https://leetcode.com/problems/generate-parentheses/)|[generate-parentheses](https://leetcode-cn.com/problems/generate-parentheses/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/GenerateParentheses.java)|100.00% 68.18%|Backtracking|
|0048|[rotate-image](https://leetcode.com/problems/rotate-image/)|[rotate-image](https://leetcode-cn.com/problems/rotate-image/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/RotateImage.java)|100% 100%|Find Pattern|
|0055|[jump-game](https://leetcode.com/problems/jump-game/)|[jump-game](https://leetcode-cn.com/problems/jump-game/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/JumpGame.java)|100% 5.09%|Dynamic Programming|
|0125|[valid-palindrome](https://leetcode.com/problems/valid-palindrome/)|[valid-palindrome](https://leetcode-cn.com/problems/valid-palindrome/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/ValidPalindrome.java)|100% 100%|String|
|0234|[palindrome-linked-list](https://leetcode.com/problems/palindrome-linked-list/)|[palindrome-linked-list](https://leetcode-cn.com/problems/palindrome-linked-list/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromeLinkedList.java)|99.87% 7.54%|findpattern.palindromic|
|0516|[longest-palindromic-subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)|[longest-palindromic-subsequence](https://leetcode-cn.com/problems/longest-palindromic-subsequence/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/LongestPalindromicSubsequence.java)|100% 100%|Dynamic Programming|
|0647|[palindromic-substrings](https://leetcode.com/problems/palindromic-substrings/)|[palindromic-substrings](https://leetcode-cn.com/problems/palindromic-substrings/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/PalindromicSubstrings.java)|99.97% 100.00%|Dynamic Programming|
|0680|[valid-palindrome-ii](https://leetcode.com/problems/valid-palindrome-ii/)|[valid-palindrome-ii](https://leetcode-cn.com/problems/valid-palindrome-ii/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/findpattern/palindromic/ValidPalindromeII.java)|99.68% 94.44%|String|

### Depth-First Search
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0112|[path-sum](https://leetcode.com/problems/path-sum/)|[path-sum](https://leetcode-cn.com/problems/path-sum/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/depthfirstsearch/PathSum.java)|100.00% 6.52%|Depth-First Search|
|0113|[path-sum-ii](https://leetcode.com/problems/path-sum-ii/)|[path-sum-ii](https://leetcode-cn.com/problems/path-sum-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/depthfirstsearch/PathSumII.java)|65.46% 5.26%|Depth-First Search|
|0113|[path-sum-ii](https://leetcode.com/problems/path-sum-ii/)|[path-sum-ii](https://leetcode-cn.com/problems/path-sum-ii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/depthfirstsearch/BinaryTreeMaximumPathSum.java)|99.67% 1ms 7.69%|Depth-First Search|
|0129|[sum-root-to-leaf-numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)|[sum-root-to-leaf-numbers](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/depthfirstsearch/SumRootToLeafNumbers.java)|100.00% 87.92%|Depth-First Search|
|0257|[binary-tree-paths](https://leetcode.com/problems/binary-tree-paths/)|[binary-tree-paths](https://leetcode-cn.com/problems/binary-tree-paths/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/depthfirstsearch/BinaryTreePaths.java)|93.46% 37.08%|Depth-First Search|

### Greedy
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0012|[integer-to-roman](https://leetcode.com/problems/integer-to-roman/)|[integer-to-roman](https://leetcode-cn.com/problems/integer-to-roman/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/greedy/IntegerToRoman.java)|100.00% 100.00%|Greedy|
|0013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)|[roman-to-integer](https://leetcode-cn.com/problems/roman-to-integer/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/greedy/RomanToInteger.java)|94.96% 94.49%|Math|
|0053|[maximum-subarray](https://leetcode.com/problems/maximum-subarray/)|[maximum-subarray](https://leetcode-cn.com/problems/maximum-subarray/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/greedy/MaximumSubarray.java)|100.00% 99.53%|Greedy, DP|
|0392|[is-subsequence](https://leetcode.com/problems/is-subsequence/)|[is-subsequence](https://leetcode-cn.com/problems/is-subsequence/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/greedy/IsSubsequence.java)|100.00% 100.00%|Greedy|
|0751|[ip-to-cidr](https://leetcode.com/problems/ip-to-cidr/)|[ip-to-cidr](https://leetcode-cn.com/problems/ip-to-cidr/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/greedy/IPToCIDR.java)|100.00% 100.00%|Greedy|

### Minimax
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0292|[nim-game](https://leetcode.com/problems/nim-game/)|[nim-game](https://leetcode-cn.com/problems/nim-game/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/NimGame.java)|100.00% 100.00%|Minimax|
|0375|[guess-number-higher-or-lower-ii](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)|[guess-number-higher-or-lower-ii](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/GuessNumberHigherOrLowerII.java)|99.47% 5.41%|Minimax|
|0486|[predict-the-winner](https://leetcode.com/problems/predict-the-winner/)|[predict-the-winner](https://leetcode-cn.com/problems/predict-the-winner/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/PredictTheWinner.java)|100.00% 5.45%|Minimax|
|0877|[stone-game](https://leetcode.com/problems/stone-game/)|[stone-game](https://leetcode-cn.com/problems/stone-game/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/StoneGame.java)|100.00% 100.00%|Minimax|
|1140|[stone-game-ii](https://leetcode.com/problems/stone-game-ii/)|[stone-game-ii](https://leetcode-cn.com/problems/stone-game-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/dynamicprogramming/minimax/StoneGameII.java)|100.00% 100.00%|Minimax|

### String Match
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0028|[implement-strstr](https://leetcode.com/problems/implement-strstr/)|[implement-strstr](https://leetcode-cn.com/problems/implement-strstr/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stringmatch/ImplementStrStr.java)|53.86% 64.88%|String|
|0030|[substring-with-concatenation-of-all-words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)|[substring-with-concatenation-of-all-words](https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stringmatch/SubstringWithConcatenationOfAllWords.java)|47.38% 5.00%|String Match|
|0758|[bold-words-in-string](https://leetcode.com/problems/bold-words-in-string/)|[bold-words-in-string](https://leetcode-cn.com/problems/bold-words-in-string/)|Easy +|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/stringmatch/BoldWordsInString.java)|96.18% 100.00%|String Match|

### Ordered Map
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0220|[contains-duplicate-iii](https://leetcode.com/problems/contains-duplicate-iii/)|[contains-duplicate-iii](https://leetcode-cn.com/problems/contains-duplicate-iii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/orderedmap/ContainsDuplicateIII.java)|90.80% 5.28%|Ordered Map|
|0352|[data-stream-as-disjoint-intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)|[data-stream-as-disjoint-intervals](https://leetcode-cn.com/problems/data-stream-as-disjoint-intervals/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/orderedmap/DataStreamAsDisjointIntervals.java)|75.24% 75.00%|Ordered Map|
|0729|[my-calendar-i](https://leetcode.com/problems/my-calendar-i/)|[my-calendar-i](https://leetcode-cn.com/problems/my-calendar-i/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/orderedmap/MyCalendarI.java)|55.27% 19.51%|Ordered Map|
|0731|[my-calendar-ii](https://leetcode.com/problems/my-calendar-ii/)|[my-calendar-ii](https://leetcode-cn.com/problems/my-calendar-ii/)|Medium+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/orderedmap/MyCalendarII.java)|100.00% 70.83%|Ordered Map|

### Sliding Window
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

### Geometry
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0892|[surface-area-of-3d-shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/)|[surface-area-of-3d-shapes](https://leetcode-cn.com/problems/surface-area-of-3d-shapes/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/geometry/SurfaceAreaOf3DShapes.java)|77.35% 100.00%|Math|
|0963|[minimum-area-rectangle-ii](https://leetcode.com/problems/minimum-area-rectangle-ii/)|[minimum-area-rectangle-ii](https://leetcode-cn.com/problems/minimum-area-rectangle-ii/)|Medium+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/geometry/MinimumAreaRectangleII.java)|52.63% 100.00%|Geometry|
|1401|[circle-and-rectangle-overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|[circle-and-rectangle-overlapping](https://leetcode-cn.com/problems/circle-and-rectangle-overlapping/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/geometry/CircleAndRectangleOverlapping.java)|100.00% 100.00%|Geometry|

### Tree
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0095|[unique-binary-search-trees-ii](https://leetcode.com/problems/unique-binary-search-trees-ii/)|[unique-binary-search-trees-ii](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/UniqueBinarySearchTreesII.java)|100.00% 99.41%|Binary Search Tree;Dynamic Programming|
|0096|[unique-binary-search-trees](https://leetcode.com/problems/unique-binary-search-trees/)|[unique-binary-search-trees](https://leetcode-cn.com/problems/unique-binary-search-trees/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/UniqueBinarySearchTrees.java)|100.00% 99.41%|Binary Search Tree;Dynamic Programming|
|0098|[validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree/)|[validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/ValidateBinarySearchTree.java)|100.00% 5.80%|Binary Search Tree|
|0100|[same-tree](https://leetcode.com/problems/same-tree/)|[same-tree](https://leetcode-cn.com/problems/same-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SameTree.java)|100.00% 0ms 5.33%|Binary Tree|
|0101|[symmetric-tree](https://leetcode.com/problems/symmetric-tree/)|[symmetric-tree](https://leetcode-cn.com/problems/symmetric-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SymmetricTree.java)|100.00% 26.66%|Binary Tree|
|0104|[maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/MaximumDepthOfBinaryTree.java)|100.00% 25.42%|Binary Tree|
|0105|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/ConstructBinaryTreeFromPreorderAndInorderTraversal.java)|77.57% 70.00%|Binary Tree|
|0106|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/ConstructBinaryTreefromInorderAndPostorderTraversal.java)|74.17% 61.90%|Binary Tree|
|0108|[convert-sorted-array-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[convert-sorted-array-to-binary-search-tree](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/ConvertSortedArraytoBinarySearchTree.java)|100.00% 5.06%|Binary Search Tree|
|0110|[balanced-binary-tree](https://leetcode.com/problems/balanced-binary-tree/)|[balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/BalancedBinaryTree.java)|99.69% 1ms 23.53%|Binary Tree|
|0114|[flatten-binary-tree-to-linked-list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)|[flatten-binary-tree-to-linked-list](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/morristraversal/FlattenBinaryTreeToLinkedList.java)|100% 99.89%|Morris Traversal|
|0116|[populating-next-right-pointers-in-each-node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)|[populating-next-right-pointers-in-each-node](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/PopulatingNextRightPointersInEachNode.java)|100% 100%|Binary Tree|
|0117|[populating-next-right-pointers-in-each-node-ii](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|[populating-next-right-pointers-in-each-node-ii](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/PopulatingNextRightPointersInEachNodeII.java)|45.96% 50.00%|Binary Tree|
|0139|[word-break](https://leetcode.com/problems/word-break/)|[word-break](https://leetcode-cn.com/problems/word-break/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/WordBreak.java)|99.62% 77.20%|tree.trie|
|0140|[word-break-ii](https://leetcode.com/problems/word-break-ii/)|[word-break-ii](https://leetcode-cn.com/problems/word-break-ii/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/WordBreakII.java)|100.00% 92.20%|tree.trie|
|0173|[binary-search-tree-iterator](https://leetcode.com/problems/binary-search-tree-iterator/)|[binary-search-tree-iterator](https://leetcode-cn.com/problems/binary-search-tree-iterator/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/BinarySearchTreeIterator.java)|72.82% 100%|Binary Search Tree，Stack|
|0208|[implement-trie-prefix-tree](https://leetcode.com/problems/implement-trie-prefix-tree/)|[implement-trie-prefix-tree](https://leetcode-cn.com/problems/implement-trie-prefix-tree/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/ImplementTriePrefixTree.java)|99.79% 98.24%|Trie|
|0211|[design-add-and-search-words-data-structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)|[design-add-and-search-words-data-structure](https://leetcode-cn.com/problems/design-add-and-search-words-data-structure/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/DesignAddAndSearchWordsDataStructure.java)|100.00% 76.32%|Trie|
|0226|[invert-binary-tree](https://leetcode.com/problems/invert-binary-tree/)|[invert-binary-tree](https://leetcode-cn.com/problems/invert-binary-tree/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/InvertBinaryTree.java)|100.00% 48.73%|Binary Tree|
|0235|[lowest-common-ancestor-of-a-binary-search-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)|[lowest-common-ancestor-of-a-binary-search-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/LowestCommonAncestorOfABinarySearchTree.java)|99.85% 6.06%|Binary Search Tree|
|0236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/LowestCommonAncestorOfABinaryTree.java)|100.00% 44.21%|Binary Tree|
|0236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/AllNodesDistanceKInBinaryTree.java)|100% 19.83%|Binary Tree|
|0297|[serialize-and-deserialize-binary-tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)|[serialize-and-deserialize-binary-tree](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SerializeAndDeserializeBinaryTree.java)|26.24% 33.57%|Binary Tree|
|0404|[sum-of-left-leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[sum-of-left-leaves](https://leetcode-cn.com/problems/sum-of-left-leaves/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SumOfLeftLeaves.java)|100.00% 88.90%|Binary Tree|
|0450|[delete-node-in-a-bst](https://leetcode.com/problems/delete-node-in-a-bst/)|[delete-node-in-a-bst](https://leetcode-cn.com/problems/delete-node-in-a-bst/)|Medium+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/DeleteNodeInABST.java)|100.00% 20.00%|Binary Search Tree|
|0501|[find-mode-in-binary-search-tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/)|[find-mode-in-binary-search-tree](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/morristraversal/FindModeInBinarySearchTree.java)|100% 100%|Morris Traversal|
|0530|[minimum-distance-between-bst-nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)|[minimum-distance-between-bst-nodes](https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/MinimumDistanceBetweenBSTNodes.java)|100.00% 52.53%|Binary Search Tree|
|0538|[convert-bst-to-greater-tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)|[convert-bst-to-greater-tree](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/ConvertBSTToGreaterTree.java)|98.33% 62.29%|Binary Search Tree|
|0543|[diameter-of-binary-tree](https://leetcode.com/problems/diameter-of-binary-tree/)|[diameter-of-binary-tree](https://leetcode-cn.com/problems/diameter-of-binary-tree/)|Easy+|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/DiameterOfBinaryTree.java)|100.00% 23.72%|tree.binarytree|
|0563|[binary-tree-tilt](https://leetcode.com/problems/binary-tree-tilt/)|[binary-tree-tilt](https://leetcode-cn.com/problems/binary-tree-tilt/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/BinaryTreeTilt.java)|100.00% 31.25%|tree.binarytree|
|0589|[n-ary-tree-preorder-traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)|[n-ary-tree-preorder-traversal](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/NaryTreePreorderTraversal.java)|100.00% 17.07%|Tree|
|0617|[merge-two-binary-trees](https://leetcode.com/problems/merge-two-binary-trees/)|[merge-two-binary-trees](https://leetcode-cn.com/problems/merge-two-binary-trees/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/MergeTwoBinaryTrees.java)|100.00% 17.28%|Binary Tree|
|0671|[second-minimum-node-in-a-binary-tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/)|[second-minimum-node-in-a-binary-tree](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarytree/SecondMinimumNodeInABinaryTree.java)|100.00% 93.19%|Binary Tree|
|0700|[search-in-a-binary-search-tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)|[search-in-a-binary-search-tree](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)|Easy-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/binarysearchtree/SearchInABinarySearchTree.java)|100.00% 9.09%|Binary Search Tree|
|0720|[longest-word-in-dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)|[longest-word-in-dictionary](https://leetcode-cn.com/problems/longest-word-in-dictionary/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/LongestWordInDictionary.java)|100.00% 97.61%|Trie|
|1023|[camelcase-matching](https://leetcode.com/problems/camelcase-matching/)|[camelcase-matching](https://leetcode-cn.com/problems/camelcase-matching/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/trie/CamelcaseMatching.java)|100.00% 99.58%|Trie|

### Design
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|Offer20|[biao-shi-shu-zhi-de-zi-fu-chuan-lcof](https://leetcode.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/)|[biao-shi-shu-zhi-de-zi-fu-chuan-lcof](https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/design/isNumber.java)|66.54% 58.76%|Math|
|0146|[lru-cache](https://leetcode.com/problems/lru-cache/)|[lru-cache](https://leetcode-cn.com/problems/lru-cache/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/design/LRUCache.java)|91.27% 67.29%|Design|
|Offer09|[yong-liang-ge-zhan-shi-xian-dui-lie-lcof](https://leetcode.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/)|[yong-liang-ge-zhan-shi-xian-dui-lie-lcof](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/design/CQueue.java)|69.99% 40.92%|Queue, Stack|

### Pure Programming
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0151|[reverse-words-in-a-string](https://leetcode.com/problems/reverse-words-in-a-string/)|[reverse-words-in-a-string](https://leetcode-cn.com/problems/reverse-words-in-a-string/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/pureprogramming/ReverseWordsInAString.java)|100.00% 16.01%|Pure Programming|
|1360|[number-of-days-between-two-dates](https://leetcode.com/problems/number-of-days-between-two-dates/)|[number-of-days-between-two-dates](https://leetcode-cn.com/problems/number-of-days-between-two-dates/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/pureprogramming/NumberOfDaysBetweenTwoDates.java)|100% 100%|Details|
|mst16.04|[tic-tac-toe-lcci](https://leetcode.com/problems/tic-tac-toe-lcci/)|[tic-tac-toe-lcci](https://leetcode-cn.com/problems/tic-tac-toe-lcci/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/pureprogramming/TicTacToeLCCI.java)|75.80% 5.19%|Pure Programming|

### Morris Traversal
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0114|[flatten-binary-tree-to-linked-list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)|[flatten-binary-tree-to-linked-list](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/morristraversal/FlattenBinaryTreeToLinkedList.java)|100% 99.89%|Morris Traversal|
|0501|[find-mode-in-binary-search-tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/)|[find-mode-in-binary-search-tree](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/tree/morristraversal/FindModeInBinarySearchTree.java)|100% 100%|Morris Traversal|

### Merge
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0021|[merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists/)|[merge-two-sorted-lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/merge/MergeTwoSortedLists.java)|100.00% 79.05%|Linked List, Recursion|
|0023|[merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[merge-k-sorted-lists](https://leetcode-cn.com/problems/merge-k-sorted-lists/)|Hard|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/merge/MergeKSortedLists.java)|84.07% 48.81%|Divide & Conquer|

### Union Find
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0547|[friend-circles](https://leetcode.com/problems/friend-circles/)|[friend-circles](https://leetcode-cn.com/problems/friend-circles/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/unionfind/FriendCircles.java)|99.93% 96.00%|Union Find|
|0990|[satisfiability-of-equality-equations](https://leetcode.com/problems/satisfiability-of-equality-equations/)|[satisfiability-of-equality-equations](https://leetcode-cn.com/problems/satisfiability-of-equality-equations/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/unionfind/SatisfiabilityOfEqualityEquations.java)|100.00% 16.67%|Union Find|

### Divide & Conquer
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0215|[kth-largest-element-in-an-array](https://leetcode.com/problems/kth-largest-element-in-an-array/)|[kth-largest-element-in-an-array](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/divideandconquer/KthLargestElementInAnArray.java)|99.87% 5.15%|Divide & Conquer, Heap|
|0241|[different-ways-to-add-parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)|[different-ways-to-add-parentheses](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/divideandconquer/DifferentWaysToAddParentheses.java)|100% 100%|Divide & Conquer|

### Concurrency
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|1114|[print-in-order](https://leetcode.com/problems/print-in-order/)|[print-in-order](https://leetcode-cn.com/problems/print-in-order/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/concurrency/PrintInOrder.java)|100% 100%|Concurrency|

### Fast Slow Pointers
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[remove-nth-node-from-end-of-list](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)|Medium-|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/twopointers/fastslowpointers/RemoveNthNodeFromEndOfList.java)|100.00% 94.24%|Two Pointers|

### Hash Function
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0939|[minimum-area-rectangle](https://leetcode.com/problems/minimum-area-rectangle/)|[minimum-area-rectangle](https://leetcode-cn.com/problems/minimum-area-rectangle/)|Medium|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/hashfunction/MinimumAreaRectangle.java)|77.35% 100.00%|Hash Function|

### Graph
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0997|[find-the-town-judge](https://leetcode.com/problems/find-the-town-judge/)|[find-the-town-judge](https://leetcode-cn.com/problems/find-the-town-judge/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/graph/FindTheTownJudge.java)|98.73% 100.00%|Graph|

### Greatest Common Divisor
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|1071|[greatest-common-divisor-of-strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[greatest-common-divisor-of-strings](https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/)|Easy|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/math/gcd/GreatestCommonDivisorOfStrings.java)|97.81% 100.00%|Greatest Common Divisor|

### Heap
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|
|0703|[kth-largest-element-in-a-stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)|[kth-largest-element-in-a-stream](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/)|null|[java](https://github.com/Fanlu91/FanluLeetcode/blob/master/src/heap/KthLargestElementInAStream.java)|99.55% 64.02%|Heap|

### Recursion
总结调整中，草稿内容请参考[这里](https://github.com/Fanlu91/FanluLeetcode/tree/master/knowledge)

|题号|题目（官网）|题目（中国）|难度|代码|结果|标签|
|---|---|---|---|---|---|---|

FanluLeetcode

FanluLeetcode Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

FanluLeetcode

FanluLeetcode Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README