leetcode算法题目

题目官网: https://leetcode.com/problemset/all/

<br>题目由java和python实现，按照类型分为: array, list, string, hashtable, math, tree:<br>

1.array

<table border="2" > <tr align="center" > <th width="300">题号</th> <th width="300">题目内容</th> <th width="300">题目难度</th> </tr> <tr> <th >733</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104135666">Flood Fill</a></th> <th>Easy</th> </tr> <tr> <th >240</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104163813">Search 2D</a></th> <th>Easy</th> </tr> <tr> <th>57</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/112842309">Insert Interval</a></th> <th>Middle</th> </tr> <tr> <th>42</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85164977">Trapping Rain Water</a></th> <th>Hard</th> </tr> <tr> <th >84</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85253780">Largest Rectangle in Histogram</a></th> <th>Hard</th> </tr> <tr> <th >*152</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85235720">Maximum Product Subarray</a></th> <th>Middle</th> </tr> <tr> <th >85</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85229189">Maximal Rectangle</a></th> <th>Hard</th> </tr> <tr> <th >322</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85223632">Coin Change</a></th> <th>Middle</th> </tr> <tr> <th >621</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85221280">Task Scheduler</a></th> <th>Middle</th> </tr> <tr> <th >221</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85161333">Maximal Square</a></th> <th>Middle</th> </tr> <tr> <th >279</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85159912">Perfect Squares</a></th> <th>Middle</th> </tr> <tr> <th >62</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85019853">Unique Paths</a></th> <th>Middle</th> </tr> <tr> <th >11</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85018708">Container With Most Water</a></th> <th>Middle</th> </tr> <tr> <th >287</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85015366">Find the Duplicate Number</a></th> <th>Middle</th> </tr> <tr> <th> *128</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85006310">Longest Consecutive Sequence</a></th> <th>Middle</th> </tr> <tr> <th >*215</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84993730">Kth Largest Element in an Array</a></th> <th>Middle</th> </tr> <tr> <th >*55</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84991870">Jump Game</a></th> <th>Middle</th> </tr> <tr> <th >300</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84984249">Longest Increasing Subsequence</a></th> <th>Middle</th> </tr> <tr> <th >*64</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84979265">Minimum Path Sum</a></th> <th>Middle</th> </tr> <tr> <th >56</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84978045">Merge Intervals</a></th> <th>Middle</th> </tr> <tr> <th >72</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84976445">Edit Distance</a></th> <th>Middle</th> </tr> <tr> <th >39</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84960687">Combination Sum</a></th> <th>Middle</th> </tr> <tr> <th >200</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84960329">Number of Islands</a></th> <th>Middle</th> </tr> <tr> <th >560</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84952201">Subarray Sum Equals K</a></th> <th>Middle</th> </tr> <tr> <th >406</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84941352">Queue Reconstruction by Height</a></th> <th>Middle</th> </tr> <tr> <th >416</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84936435">Partition Equal Subset Sum</a></th> <th>Middle</th> </tr> <tr> <th >4</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84875908">Median of Two Sorted Arrays</a></th> <th>Middle</th> </tr> <tr> <th >121</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84857583">Best Time to Buy and Sell Stock</a></th> <th>Easy</th> </tr> <tr> <th >581</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84855501">Shortest Unsorted Continuous Subarray</a></th> <th>Easy</th> </tr> <tr> <th >70</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84839426">Climbing Stairs</a></th> <th>Easy</th> </tr> <tr> <th >437</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84837693">Path Sum III</a></th> <th >Middle</th> </tr> <tr> <th >*198</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84836482">House Robber</a></th> <th>Easy</th> </tr> <tr> <th >2</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84784785">Add Two Numbers</a></th> <th>Easy</th> </tr> <tr> <th >15</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84784251">Three Sum</a></th> <th>Easy</th> </tr> <tr> <th >448</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84728191">Find All Numbers Disappeared in an Array</a></th> <th>Middle</th> </tr> <tr> <th >283</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84726668">Move Zeroes</a></th> <th>Easy</th> </tr> <tr> <th >169</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84715556">Majority Element</a></th> <th>Easy</th> </tr> <tr> <th >494</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84643519">Target Sum</a></th> <th>Easy</th> </tr> <tr> <th >349</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83096060">Intersection of Two Arrays</a></th> <th>Easy</th> </tr> <tr> <th >350</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83069550">Intersection of Two Arrays II</a></th> <th>Easy</th> </tr> <tr> <th >136</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83185189">Single Number</a></th> <th>Easy</th> </tr> <tr> <th >7</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83182653">Reverse Integer</a></th> <th>Easy</th> </tr> <tr> <th >347</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84310615">Top K Frequent Elements</a></th> <th>Easy</th> </tr><tr> <th >35</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84299628">Search Insert Position</a></th> <th>Easy</th> </tr><tr> <th >*268</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83933311">Missing Number</a></th> <th>Easy</th> </tr> <tr> <th >*521</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83744906">Longest Uncommon Subsequence I</a></th> <th>Easy</th> </tr> <tr> <th >217</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/103976728">Contains Duplicate</a></th> <th>Easy</th> </tr> <tr> <th >728</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/103983703">Self Dividing Numbers</a></th> <th>Easy</th> </tr> <tr> <th>122</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104198493">Best Time Buy</a></th> <th>Easy</th> </tr> <tr> <th>1217</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104282307">Play With Chips</a></th> <th>Easy</th> </tr> <tr> <th >26</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84562766">Remove Duplicates from Sorted Array</a></th> <th>Easy</th> </tr> <tr> <th >53</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84848699">Maximum Subarray</a></th> <th>Easy</th> </tr> </table>

2.list

<table border="2" > <tr align="center" > <th width="300">题号</th> <th width="300">题目内容</th> <th width="300">题目难度</th> </tr> <tr> <th >114</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85163338">Flatten Binary Tree to Linked List</a></th> <th>Middle</th> </tr> <tr> <th >23</th> <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84994970">Merge k Sorted Lists</a></th> <th>Middle</th> </tr> <tr> <th >*142</th> <th><a target="_blank"