合集 | LeetCode 个人题解目录（长期更新）

左手的ㄟ右手 2022-12-24 00:44 122阅读 0赞

## 目录 ##

<table> 
 <thead> 
  <tr> 
   <th>No.</th> 
   <th>Problem</th> 
   <th>LeetCode</th> 
   <th>力扣</th> 
   <th>Python</th> 
   <th>Go</th> 
   <th>Solution</th> 
   <th>Difficulty</th> 
   <th>Tag</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>0017</td> 
   <td>Letter Combinations of a Phone Number</td> 
   <td><a href="https://leetcode.com/problems/letter-combinations-of-a-phone-number/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/submissions/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0017-Letter-Combinations-of-a-Phone-Number/0017.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104662602" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯、暴力</td> 
  </tr> 
  <tr> 
   <td>0034</td> 
   <td>Find First and Last Position of Element in Sorted Array</td> 
   <td><a href="https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0034-Find-First-and-Last-Position-of-Element-in-Sorted-Array/0034.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104454711" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二分</td> 
  </tr> 
  <tr> 
   <td>0039</td> 
   <td>Combination Sum</td> 
   <td><a href="https://leetcode.com/problems/combination-sum/description/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/combination-sum/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0039-Combination-Sum/0039.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104713477" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0040</td> 
   <td>Combination Sum II</td> 
   <td><a href="https://leetcode.com/problems/combination-sum-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/combination-sum-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0040-Combination-Sum-II/0040.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/108508820" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0046</td> 
   <td>Permutations</td> 
   <td><a href="https://leetcode.com/problems/permutations/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/permutations/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0046-Permutations/0046.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104665174" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0047</td> 
   <td>Permutations II</td> 
   <td><a href="https://leetcode.com/problems/permutations-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/permutations-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0047-Permutations-II/0047.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104684215" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>递归、回溯</td> 
  </tr> 
  <tr> 
   <td>0051</td> 
   <td>N-Queens</td> 
   <td><a href="https://leetcode.com/problems/n-queens/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/n-queens/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0051-N-Queens/0051.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/108524302" rel="nofollow">CSDN</a></td> 
   <td>Hard</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0053</td> 
   <td>Maximum Subarray</td> 
   <td><a href="https://leetcode.com/problems/maximum-subarray/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/maximum-subarray/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0053-Maximum-Subarray/0053.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104430145" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0069</td> 
   <td>Sqrt(x)</td> 
   <td><a href="https://leetcode.com/problems/sqrtx/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/sqrtx/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0069-Sqrt-x/0069.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104445312" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二分、牛顿迭代</td> 
  </tr> 
  <tr> 
   <td>0070</td> 
   <td>Climbing Stairs</td> 
   <td><a href="https://leetcode.com/problems/climbing-stairs/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/climbing-stairs/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0070-Climbing-Stairs/0070.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105149396" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0075</td> 
   <td>Sort Colors</td> 
   <td><a href="https://leetcode.com/problems/sort-colors/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/sort-colors/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0075-Sort-Colors/0075.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104332975" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>荷兰旗</td> 
  </tr> 
  <tr> 
   <td>0077</td> 
   <td>Combinations</td> 
   <td><a href="https://leetcode.com/problems/combinations/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/combinations/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0077-Combinations/0077.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104685724" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0079</td> 
   <td>Word Search</td> 
   <td><a href="https://leetcode.com/problems/word-search/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/word-search/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0079-Word-Search/0079.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104663556" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0088</td> 
   <td>Merge Sorted Array</td> 
   <td><a href="https://leetcode.com/problems/merge-sorted-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/merge-sorted-array/submissions/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0088-Merge-Sorted-Array/0088.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104288724" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0093</td> 
   <td>Restore IP Addresses</td> 
   <td><a href="https://leetcode.com/problems/restore-ip-addresses/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/restore-ip-addresses/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0093-Restore-IP-Addresses/0093.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104662059" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯、暴力</td> 
  </tr> 
  <tr> 
   <td>0095</td> 
   <td>Unique Binary Search Trees II</td> 
   <td><a href="https://leetcode.com/problems/unique-binary-search-trees-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/unique-binary-search-trees-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0095-Unique-Binary-Search-Trees-II/0095.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104518007" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>分治、DFS</td> 
  </tr> 
  <tr> 
   <td>0098</td> 
   <td>Validate Binary Search Tree</td> 
   <td><a href="https://leetcode.com/problems/validate-binary-search-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/validate-binary-search-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0098-Validate-Binary-Search-Tree/0098.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/107007147" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0100</td> 
   <td>Same Tree</td> 
   <td><a href="https://leetcode.com/problems/same-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/same-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0100-Same-Tree/0100.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/106992860" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0102</td> 
   <td>Binary Tree Level Order Traversal</td> 
   <td><a href="https://leetcode.com/problems/binary-tree-level-order-traversal/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/binary-tree-level-order-traversal/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0102-Binary-Tree-Level-Order-Traversal/0102.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105001349" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、BFS</td> 
  </tr> 
  <tr> 
   <td>0105</td> 
   <td>Construct Binary Tree from Preorder and Inorder Traversal</td> 
   <td><a href="https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/0105.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104952777" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、递归</td> 
  </tr> 
  <tr> 
   <td>0106</td> 
   <td>Construct Binary Tree from Inorder and Postorder Traversal</td> 
   <td><a href="https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/0106.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104953562" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、递归</td> 
  </tr> 
  <tr> 
   <td>0111</td> 
   <td>Minimum Depth of Binary Tree</td> 
   <td><a href="https://leetcode.com/problems/minimum-depth-of-binary-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0111-Minimum-Depth-of-Binary-Tree/0111.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/108149026" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0113</td> 
   <td>Path Sum II</td> 
   <td><a href="https://leetcode.com/problems/path-sum-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/path-sum-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0113-Path-Sum-II/0113.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105061186" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>0121</td> 
   <td>Best Time to Buy and Sell Stock</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0121-Best-Time-to-Buy-and-Sell-Stock/0121.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104402622" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0122</td> 
   <td>Best Time to Buy and Sell Stock II</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0122-Best-Time-to-Buy-and-Sell-Stock-II/0122.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104405384" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0123</td> 
   <td>Best Time to Buy and Sell Stock III</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0123-Best-Time-to-Buy-and-Sell-Stock-III/0123.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104807010" rel="nofollow">CSDN</a></td> 
   <td>Hard</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0127</td> 
   <td>Word Ladder</td> 
   <td><a href="https://leetcode.com/problems/word-ladder/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/word-ladder/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0127-Word-Ladder/0127.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104565467" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>BFS</td> 
  </tr> 
  <tr> 
   <td>0130</td> 
   <td>Surrounded Regions</td> 
   <td><a href="https://leetcode.com/problems/surrounded-regions/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/surrounded-regions/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0130-Surrounded-Regions/0130.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104575237" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0141</td> 
   <td>Linked List Cycle</td> 
   <td><a href="https://leetcode.com/problems/linked-list-cycle/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/linked-list-cycle/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0141-Linked-List-Cycle/0141.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104292882" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0153</td> 
   <td>Find Minimum in Rotated Sorted Array</td> 
   <td><a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104451433" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二分</td> 
  </tr> 
  <tr> 
   <td>0167</td> 
   <td>Two Sum II - Input array is sorted</td> 
   <td><a href="https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0167-Two-Sum-II-Input-array-is-sorted/0167.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104271994" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0169</td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>0188</td> 
   <td>Best Time to Buy and Sell Stock IV</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104808307" rel="nofollow">CSDN</a></td> 
   <td>Hard</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0200</td> 
   <td>Number of Islands</td> 
   <td><a href="https://leetcode.com/problems/number-of-islands/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/number-of-islands/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0200-Number-of-Islands/0200.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104566790" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0206</td> 
   <td>Reverse Linked List</td> 
   <td><a href="https://leetcode.com/problems/reverse-linked-list/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/reverse-linked-list/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0206-Reverse-Linked-List/0206.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104613515" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>0215</td> 
   <td>Kth Largest Element in an Array</td> 
   <td><a href="https://leetcode.com/problems/kth-largest-element-in-an-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/kth-largest-element-in-an-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0215-Kth-Largest-Element-in-an-Array/0215.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104319941" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>快排、堆</td> 
  </tr> 
  <tr> 
   <td>0225</td> 
   <td>Implement Stack using Queues</td> 
   <td><a href="https://leetcode.com/problems/implement-stack-using-queues/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/implement-stack-using-queues/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0225-Implement-Stack-using-Queues/0225.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104602519" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>栈、队列</td> 
  </tr> 
  <tr> 
   <td>0226</td> 
   <td>Invert Binary Tree</td> 
   <td><a href="https://leetcode.com/problems/invert-binary-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/invert-binary-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0226-Invert-Binary-Tree/0226.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104978148" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树、递归</td> 
  </tr> 
  <tr> 
   <td>0240</td> 
   <td>Search a 2D Matrix II</td> 
   <td><a href="https://leetcode.com/problems/search-a-2d-matrix-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/search-a-2d-matrix-ii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0240-Search-a-2D-Matrix-II/0240.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104931011" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>0241</td> 
   <td>Different Ways to Add Parentheses</td> 
   <td><a href="https://leetcode.com/problems/different-ways-to-add-parentheses/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/different-ways-to-add-parentheses/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0241-Different-Ways-to-Add-Parentheses/0241.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104496806" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>分治</td> 
  </tr> 
  <tr> 
   <td>0257</td> 
   <td>Binary Tree Paths</td> 
   <td><a href="https://leetcode.com/problems/binary-tree-paths/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/binary-tree-paths/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0257-Binary-Tree-Paths/0257.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104622561" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0278</td> 
   <td>First Bad Version</td> 
   <td><a href="https://leetcode.com/problems/first-bad-version/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/first-bad-version/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0278-First-Bad-Version/0278.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104450409" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二分</td> 
  </tr> 
  <tr> 
   <td>0279</td> 
   <td>Perfect Squares</td> 
   <td><a href="https://leetcode.com/problems/perfect-squares/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/perfect-squares/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0279-Perfect-Squares/0279.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104527266" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>BFS、动态规划</td> 
  </tr> 
  <tr> 
   <td>0300</td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>0309</td> 
   <td>Best Time to Buy and Sell Stock with Cooldown</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0309-Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/0309.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104805193" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0322</td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>0345</td> 
   <td>Reverse Vowels of a String</td> 
   <td><a href="https://leetcode.com/problems/reverse-vowels-of-a-string/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/reverse-vowels-of-a-string/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0345-Reverse-Vowels-of-a-String/0345.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104269137" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0347</td> 
   <td>Top K Frequent Elements</td> 
   <td><a href="https://leetcode.com/problems/top-k-frequent-elements/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/top-k-frequent-elements/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0347-Top-K-Frequent-Elements/0347.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104321237" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>桶排序</td> 
  </tr> 
  <tr> 
   <td>0365</td> 
   <td>Water and Jug Problem</td> 
   <td><a href="https://leetcode.com/problems/water-and-jug-problem/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/water-and-jug-problem/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0365-Water-and-Jug-Problem/0365.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105017080" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>BFS、数学</td> 
  </tr> 
  <tr> 
   <td>0392</td> 
   <td>Is Subsequence</td> 
   <td><a href="https://leetcode.com/problems/is-subsequence/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/is-subsequence/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0392-Is-Subsequence/0392.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104408642" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0406</td> 
   <td>Queue Reconstruction by Height</td> 
   <td><a href="https://leetcode.com/problems/queue-reconstruction-by-height/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/queue-reconstruction-by-height/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0406-Queue-Reconstruction-by-Height/0406.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104349766" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0409</td> 
   <td>Longest Palindrome</td> 
   <td><a href="https://leetcode.com/problems/longest-palindrome/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/longest-palindrome/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0409-Longest-Palindrome/0409.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104976636" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>0417</td> 
   <td>Pacific Atlantic Water Flow</td> 
   <td><a href="https://leetcode.com/problems/pacific-atlantic-water-flow/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/pacific-atlantic-water-flow/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0417-Pacific-Atlantic-Water-Flow/0417.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104579445" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0435</td> 
   <td>Non-overlapping Intervals</td> 
   <td><a href="https://leetcode.com/problems/non-overlapping-intervals/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/non-overlapping-intervals/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0435-Non-overlapping-Intervals/0435.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104348616" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>区间贪心</td> 
  </tr> 
  <tr> 
   <td>0450</td> 
   <td>Delete Node in a BST</td> 
   <td><a href="https://leetcode.com/problems/delete-node-in-a-bst/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/delete-node-in-a-bst/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0450-Delete-Node-in-a-BST/0450.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/107006024" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0451</td> 
   <td>Sort Characters By Frequency</td> 
   <td><a href="https://leetcode.com/problems/sort-characters-by-frequency/submissions/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/sort-characters-by-frequency/submissions/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0451-Sort-Characters-By-Frequency/0451.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104330167" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>桶排序</td> 
  </tr> 
  <tr> 
   <td>0452</td> 
   <td>Minimum Number of Arrows to Burst Balloons</td> 
   <td><a href="https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0452-Minimum-Number-of-Arrows-to-Burst-Balloons/0452.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104347754" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>区间贪心</td> 
  </tr> 
  <tr> 
   <td>0455</td> 
   <td>Assign Cookies</td> 
   <td><a href="https://leetcode.com/problems/assign-cookies/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/assign-cookies/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0455-Assign-Cookies/0455.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104333506" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0491</td> 
   <td>Increasing Subsequences</td> 
   <td><a href="https://leetcode.com/problems/increasing-subsequences/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/increasing-subsequences/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0491-Increasing-Subsequences/0491.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/108508820" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0509</td> 
   <td>Fibonacci Number</td> 
   <td><a href="https://leetcode.com/problems/fibonacci-number/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/fibonacci-number/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0509-Fibonacci-Number/0509.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105149103" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0524</td> 
   <td>Longest Word in Dictionary through Deleting</td> 
   <td><a href="https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0524-Longest-Word-in-Dictionary-through-Deleting/0524.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104314325" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0540</td> 
   <td>Single Element in a Sorted Array</td> 
   <td><a href="https://leetcode.com/problems/single-element-in-a-sorted-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/single-element-in-a-sorted-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0540-Single-Element-in-a-Sorted-Array/0540.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104449480" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二分</td> 
  </tr> 
  <tr> 
   <td>0543</td> 
   <td>Diameter of Binary Tree</td> 
   <td><a href="https://leetcode.com/problems/diameter-of-binary-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/diameter-of-binary-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0543-Diameter-of-Binary-Tree/0543.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104777387" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>递归</td> 
  </tr> 
  <tr> 
   <td>0547</td> 
   <td>Friend Circles</td> 
   <td><a href="https://leetcode.com/problems/friend-circles/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/friend-circles/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0547-Friend-Circles/0547.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104574139" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0605</td> 
   <td>Can Place Flowers</td> 
   <td><a href="https://leetcode.com/problems/can-place-flowers/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/can-place-flowers/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0605-Can-Place-Flowers/0605.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104406673" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0633</td> 
   <td>Sum of Square Numbers</td> 
   <td><a href="https://leetcode.com/problems/sum-of-square-numbers" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/sum-of-square-numbers/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0633-Sum-of-Square-Numbers/0633.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104274301" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0647</td> 
   <td>Palindromic Substrings</td> 
   <td><a href="https://leetcode.com/problems/palindromic-substrings/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/palindromic-substrings/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0647-Palindromic-Substrings/0647.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/108150276" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0665</td> 
   <td>Non-decreasing Array</td> 
   <td><a href="https://leetcode.com/problems/non-decreasing-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/non-decreasing-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0665-Non-decreasing-Array/0665.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104411132" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>0680</td> 
   <td>Valid Palindrome II</td> 
   <td><a href="https://leetcode.com/problems/valid-palindrome-ii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/valid-palindrome-ii/submissions/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0680-Valid-Palindrome-II/0680.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104284572" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0695</td> 
   <td>Max Area of Island</td> 
   <td><a href="https://leetcode.com/problems/max-area-of-island/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/max-area-of-island/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0695-Max-Area-of-Island/0695.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104566219" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>0700</td> 
   <td>Search in a Binary Search Tree</td> 
   <td><a href="https://leetcode.com/problems/search-in-a-binary-search-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/search-in-a-binary-search-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0700-Search-in-a-Binary-Search-Tree/0700.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/107006840" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0701</td> 
   <td>Insert into a Binary Search Tree</td> 
   <td><a href="https://leetcode.com/problems/insert-into-a-binary-search-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0701-Insert-into-a-Binary-Search-Tree/0701.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/107006582" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>0714</td> 
   <td>Best Time to Buy and Sell Stock with Transaction Fee</td> 
   <td><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0714-Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/0714.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104805622" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>0744</td> 
   <td>Find Smallest Letter Greater Than Target</td> 
   <td><a href="https://leetcode.com/problems/find-smallest-letter-greater-than-target/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0744-Find-Smallest-Letter-Greater-Than-Target/0744.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104446440" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二分</td> 
  </tr> 
  <tr> 
   <td>0836</td> 
   <td>Rectangle Overlap</td> 
   <td><a href="https://leetcode.com/problems/rectangle-overlap/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/rectangle-overlap/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0836-Rectangle-Overlap/0836.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104954609" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>0876</td> 
   <td>Middle of the Linked List</td> 
   <td><a href="https://leetcode.com/problems/middle-of-the-linked-list/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/middle-of-the-linked-list/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0876-Middle-of-the-Linked-List/0876.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105060017" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>0892</td> 
   <td>Surface Area of 3D Shapes</td> 
   <td><a href="https://leetcode.com/problems/surface-area-of-3d-shapes/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/surface-area-of-3d-shapes/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0892-Surface-Area-of-3D-Shapes/0892.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105150406" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>0914</td> 
   <td>X of a Kind in a Deck of Cards</td> 
   <td><a href="https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105144538" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>0994</td> 
   <td>Rotting Oranges</td> 
   <td><a href="https://leetcode.com/problems/rotting-oranges/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/rotting-oranges/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0994-Rotting-Oranges/0994.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104653642" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>BFS</td> 
  </tr> 
  <tr> 
   <td>1013</td> 
   <td>Partition Array Into Three Parts With Equal Sum</td> 
   <td><a href="https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1013-Partition-Array-Into-Three-Parts-With-Equal-Sum/1013.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104804635" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>1071</td> 
   <td>Greatest Common Divisor of Strings</td> 
   <td><a href="https://leetcode.com/problems/greatest-common-divisor-of-strings/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1071-Greatest-Common-Divisor-of-Strings/1071.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104829264" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>1091</td> 
   <td>Shortest Path in Binary Matrix</td> 
   <td><a href="https://leetcode.com/problems/shortest-path-in-binary-matrix/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shortest-path-in-binary-matrix/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1091-Shortest-Path-in-Binary-Matrix/1091.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104525673" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>BFS</td> 
  </tr> 
  <tr> 
   <td>1103</td> 
   <td>Distribute Candies to People</td> 
   <td><a href="https://leetcode.com/problems/distribute-candies-to-people/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/distribute-candies-to-people/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1103-Distribute-Candies-to-People/1103.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104675606" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1160</td> 
   <td>Find Words That Can Be Formed by Characters</td> 
   <td><a href="https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104923690" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>1358</td> 
   <td>Number of Substrings Containing All Three Characters</td> 
   <td><a href="https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/number-of-substrings-containing-all-three-characters/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104455690" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>双指针、滑窗</td> 
  </tr> 
  <tr> 
   <td>1360</td> 
   <td>Number of Days Between Two Dates</td> 
   <td><a href="https://leetcode.com/problems/number-of-days-between-two-dates/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/number-of-days-between-two-dates/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1360-Number-of-Days-Between-Two-Dates/1360.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104462835" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>1362</td> 
   <td>Closest Divisors</td> 
   <td><a href="https://leetcode.com/problems/closest-divisors/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/closest-divisors/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/tree/master/solutions/1362-Closest-Divisors" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104464617" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>1365</td> 
   <td>How Many Numbers Are Smaller Than the Current Number</td> 
   <td><a href="https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104593401" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1366</td> 
   <td>Rank Teams by Votes</td> 
   <td><a href="https://leetcode.com/problems/rank-teams-by-votes/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/rank-teams-by-votes/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1366-Rank-Teams-by-Votes/1366.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104602097" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>排序</td> 
  </tr> 
  <tr> 
   <td>1367</td> 
   <td>Linked List in Binary Tree</td> 
   <td><a href="https://leetcode.com/problems/linked-list-in-binary-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/linked-list-in-binary-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1367-Linked-List-in-Binary-Tree/1367.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104592060" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>1370</td> 
   <td>Increasing Decreasing String</td> 
   <td><a href="https://leetcode.com/problems/increasing-decreasing-string/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/increasing-decreasing-string/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1370-Increasing-Decreasing-String/1370.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104731560" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>排序</td> 
  </tr> 
  <tr> 
   <td>1372</td> 
   <td>Longest ZigZag Path in a Binary Tree</td> 
   <td><a href="https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/longest-zigzag-path-in-a-binary-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104733479" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>1374</td> 
   <td>Generate a String With Characters That Have Odd Counts</td> 
   <td><a href="https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/generate-a-string-with-characters-that-have-odd-counts/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104733770" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>1375</td> 
   <td>Bulb Switcher III</td> 
   <td><a href="https://leetcode.com/problems/bulb-switcher-iii/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/bulb-switcher-iii/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1375-Bulb-Switcher-III/1375.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104734212" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>最大编号</td> 
  </tr> 
  <tr> 
   <td>1376</td> 
   <td>Time Needed to Inform All Employees</td> 
   <td><a href="https://leetcode.com/problems/time-needed-to-inform-all-employees/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/time-needed-to-inform-all-employees/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1376-Time-Needed-to-Inform-All-Employees/1376.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104742851" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>自底向上</td> 
  </tr> 
  <tr> 
   <td>1380</td> 
   <td>Lucky Numbers in a Matrix</td> 
   <td><a href="https://leetcode.com/problems/lucky-numbers-in-a-matrix/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1380-Lucky-Numbers-in-a-Matrix/1380.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104877686" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1381</td> 
   <td>Design a Stack With Increment Operation</td> 
   <td><a href="https://leetcode.com/problems/design-a-stack-with-increment-operation/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/design-a-stack-with-increment-operation/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1381-Design-a-Stack-With-Increment-Operation/1381.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104879183" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>栈</td> 
  </tr> 
  <tr> 
   <td>1382</td> 
   <td>Balance a Binary Search Tree</td> 
   <td><a href="https://leetcode.com/problems/balance-a-binary-search-tree/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/balance-a-binary-search-tree/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1382-Balance-a-Binary-Search-Tree/1382.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104880901" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>1385</td> 
   <td>Find the Distance Value Between Two Arrays</td> 
   <td><a href="https://leetcode.com/problems/find-the-distance-value-between-two-arrays/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105022801" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1386</td> 
   <td>Cinema Seat Allocation</td> 
   <td><a href="https://leetcode.com/problems/cinema-seat-allocation/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/cinema-seat-allocation/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1386-Cinema-Seat-Allocation/1386.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105063788" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>哈希表</td> 
  </tr> 
  <tr> 
   <td>1387</td> 
   <td>Sort Integers by The Power Value</td> 
   <td><a href="https://leetcode.com/problems/sort-integers-by-the-power-value/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/sort-integers-by-the-power-value/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1387-Sort-Integers-by-The-Power-Value/1387.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105023080" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>排序</td> 
  </tr> 
  <tr> 
   <td>1389</td> 
   <td>Create Target Array in the Given Order</td> 
   <td><a href="https://leetcode.com/problems/create-target-array-in-the-given-order/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/create-target-array-in-the-given-order/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1389-Create-Target-Array-in-the-Given-Order/1389.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105063971" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>1390</td> 
   <td>Four Divisors</td> 
   <td><a href="https://leetcode.com/problems/four-divisors/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/four-divisors/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1390-Four-Divisors/1390.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105064381" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>1394</td> 
   <td>Find Lucky Integer in an Array</td> 
   <td><a href="https://leetcode.com/problems/find-lucky-integer-in-an-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/find-lucky-integer-in-an-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1394-Find-Lucky-Integer-in-an-Array/1394.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105178838" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1395</td> 
   <td>Count Number of Teams</td> 
   <td><a href="https://leetcode.com/problems/count-number-of-teams/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/count-number-of-teams/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1395-Count-Number-of-Teams/1395.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105178534" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>1396</td> 
   <td>Design Underground System</td> 
   <td><a href="https://leetcode.com/problems/design-underground-system/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/design-underground-system/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1396-Design-Underground-System/1396.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105177955" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>设计</td> 
  </tr> 
  <tr> 
   <td>1408</td> 
   <td>String Matching in an Array</td> 
   <td><a href="https://leetcode.com/problems/string-matching-in-an-array/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/string-matching-in-an-array/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1408-String-Matching-in-an-Array/1408.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105476577" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>1409</td> 
   <td>Queries on a Permutation With Key</td> 
   <td><a href="https://leetcode.com/problems/queries-on-a-permutation-with-key/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/queries-on-a-permutation-with-key/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1409-Queries-on-a-Permutation-With-Key/1409.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105477470" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>模拟</td> 
  </tr> 
  <tr> 
   <td>1410</td> 
   <td>HTML Entity Parser HTML</td> 
   <td><a href="https://leetcode.com/problems/html-entity-parser/" rel="nofollow">LeetCode</a></td> 
   <td><a href="https://leetcode-cn.com/problems/html-entity-parser/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1410-HTML-Entity-Parser/1410.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105477787" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>面试题03</td> 
   <td>数组中重复的数字</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-03-shu-zu-zhong-zhong-fu-de-shu-zi-lcof/03.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104929428" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>哈希</td> 
  </tr> 
  <tr> 
   <td>面试题04</td> 
   <td>二维数组中的查找</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-04-er-wei-shu-zu-zhong-de-cha-zhao-lcof/04.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104930463" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>面试题05</td> 
   <td>替换空格</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-05-ti-huan-kong-ge-lcof/05.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104933419" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>面试题06</td> 
   <td>从尾到头打印链表</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-06-cong-wei-dao-tou-da-yin-lian-biao-lcof/06.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104934559" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>面试题07</td> 
   <td>重建二叉树</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-07-zhong-jian-er-cha-shu-lcof/07.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104952401" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、递归</td> 
  </tr> 
  <tr> 
   <td>面试题09</td> 
   <td>用两个栈实现队列</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-09-yong-liang-ge-zhan-shi-xian-dui-lie-lcof/09.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105149787" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>栈、队列</td> 
  </tr> 
  <tr> 
   <td>面试题10- I</td> 
   <td>斐波那契数列</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10-fei-bo-na-qi-shu-lie-lcof/10-1.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105147333" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>面试题10- II</td> 
   <td>青蛙跳台阶问题</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10-qing-wa-tiao-tai-jie-wen-ti-lcof/10-2.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105147944" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>面试题17</td> 
   <td>打印从1到最大的n位数</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-17-da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/17.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105149990" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>暴力</td> 
  </tr> 
  <tr> 
   <td>面试题26</td> 
   <td>树的子结构</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-26-shu-de-zi-jie-gou-lcof/26.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104957270" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>面试题27</td> 
   <td>二叉树的镜像</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-27-er-cha-shu-de-jing-xiang-lcof/27.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104977404" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树、递归</td> 
  </tr> 
  <tr> 
   <td>面试题32 - I</td> 
   <td>从上到下打印二叉树</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-lcof/32.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104979819" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、BFS</td> 
  </tr> 
  <tr> 
   <td>面试题32 - II</td> 
   <td>从上到下打印二叉树 II</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/32-2.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105000947" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>二叉树、BFS</td> 
  </tr> 
  <tr> 
   <td>面试题32 - III</td> 
   <td>从上到下打印二叉树 III</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/32-3.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105001825" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>二叉树、BFS</td> 
  </tr> 
  <tr> 
   <td>面试题33</td> 
   <td>二叉搜索树的后序遍历序列</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-33-er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/33.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105015692" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>递归</td> 
  </tr> 
  <tr> 
   <td>面试题34</td> 
   <td>二叉树中和为某一值的路径</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-34-er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/34.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105060958" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>回溯</td> 
  </tr> 
  <tr> 
   <td>面试题38</td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>面试题 57 - II</td> 
   <td>和为s的连续正数序列</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-57-II/5702.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104696171" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>滑窗、数学</td> 
  </tr> 
  <tr> 
   <td>面试题59 - II</td> 
   <td>队列的最大值</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/dui-lie-de-zui-da-zhi-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-59-II/5902.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104731137" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>队列</td> 
  </tr> 
  <tr> 
   <td>面试题62</td> 
   <td>圆圈中最后剩下的数字</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-62-yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/62.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105080925" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>面试题0106</td> 
   <td>字符串压缩</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/compress-string-lcci/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-01.06-compress-string-lcci/0106.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://blog.csdn.net/Wonz5130/article/details/104910414" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>面试题0107</td> 
   <td>旋转矩阵</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/rotate-matrix-lcci/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-01.07-rotate-matrix-lcci/0107.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/105476543" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>面试0410</td> 
   <td>检查子树</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/check-subtree-lcci/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-04.10-check-subtree-lcci/0410.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://wonzwang.blog.csdn.net/article/details/104592940" rel="nofollow">CSDN</a></td> 
   <td>Medium</td> 
   <td>DFS</td> 
  </tr> 
  <tr> 
   <td>面试1001</td> 
   <td>Sorted Merge LCCI</td> 
   <td></td> 
   <td><a href="https://leetcode-cn.com/problems/sorted-merge-lcci/" rel="nofollow">力扣</a></td> 
   <td><a href="https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10.01-Sorted-Merge-LCCI/1001.py" rel="nofollow">Python</a></td> 
   <td></td> 
   <td><a href="https://blog.csdn.net/Wonz5130/article/details/104630799" rel="nofollow">CSDN</a></td> 
   <td>Easy</td> 
   <td>双指针</td> 
  </tr> 
 </tbody> 
</table>

## 推荐题解 ##

[CyC LeetCode 题解][CyC LeetCode]

[负雪明烛 LeetCode 题解][LeetCode]

[coordinate LeetCode 题解][coordinate LeetCode]

[书影 LeetCode 题解][LeetCode 1]

[ApacheCN LeetCode 题解][ApacheCN LeetCode]

[PemLer LeetCode 题解][PemLer LeetCode]

## 地址 ##

[GitHub][]

## License ##

[MIT][]

[CyC LeetCode]: https://github.com/CyC2018/CS-Notes/blob/master/notes/Leetcode%20%E9%A2%98%E8%A7%A3%20-%20%E7%9B%AE%E5%BD%95.md
[LeetCode]: https://blog.csdn.net/fuxuemingzhu/category_5790037.html
[coordinate LeetCode]: https://coordinate.wang/
[LeetCode 1]: http://bookshadow.com/leetcode/
[ApacheCN LeetCode]: https://github.com/apachecn/Interview/tree/master/docs/Algorithm/Leetcode/Python
[PemLer LeetCode]: https://github.com/PemLer/Journey_of_leetcode/tree/master/leetcode
[GitHub]: https://github.com/Wonz5130/LeetCode-Solutions
[MIT]: https://github.com/Wonz5130/LeetCode-Solutions/blob/master/LICENSE