leetcode

KO | EN

gitlite — search

#hacktoberfest #ai #typescript #llm #go #rust #deep-learning #nodejs #windows #awesome #vue #pytorch #mcp #open-source

(★ 83)

java/python for leetcode: 1) array，2) list，3) string，4) hashtable，5) math，6) tree

파일 탐색기

최종 버전 다운로드 (.zip)

- - zhangyu.xml
- - Project_Default.xml
- - editor.xml
- compiler.xml
- misc.xml
- modules.xml
- uiDesigner.xml
- vcs.xml
- workspace.xml
- - leetcodepython.iml
- pyvenv.cfg
leetcode.iml
leetcode_class.md
LICENSE
README.md

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 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" href="https://blog.csdn.net/zy345293721/article/details/84961106">Linked List Cycle II</a></th>
    <th>Middle</th>
  </tr> 
  
   <tr>
    <th >160</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84850298">Intersection of Two Linked Lists</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >234</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84849622">Palindrome Linked List</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >155</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84852978">Min Stack</a></th>
    <th>Easy</th>
  </tr> 
  <tr>
    <th >148</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84846681">Sort List</a></th>
    <th>Easy</th>
  </tr>
  
   <tr>
    <th >21</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84791423">Merge Two Sorted Lists</a></th>
    <th>Easy</th>
  </tr>
  
  
  
   <tr>
    <th >206</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84032331">Reverse Linked List</a></th>
    <th>Easy</th>
  </tr> <tr>
    <th >141</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84031623">Linked List Cycle</a></th>
    <th>Easy</th>
  </tr> 
  
   <tr>
    <th >19</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/82984093">Remove Nth Node From End of List</a></th>
    <th>Easy</th>
  </tr>
  
  
</table>

## 3.string

<tr>
    <th >32</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85055216">Longest Valid Parentheses</a></th>
    <th>Hard</th>
  </tr>
  
   <tr>
    <th >*22</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85014549">Generate Parentheses</a></th>
    <th>Middle</th>
  </tr>
   <tr>
    <th >49</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85013887">Group Anagrams</a></th>
    <th>Middle</th>
  </tr>
  
  <tr>
    <th >139</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84988686">Word Break</a></th>
    <th>Middle</th>
  </tr>
  <tr>
    <th >*5</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84870880">Longest Palindromic Substring</a></th>
    <th>Easy</th>
  </tr>
  
  <tr>
    <th >394</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84957568">Decode String</a></th>
    <th>Middle</th>
  </tr>  
   <tr>
    <th >3</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84786170">Longest Substring Without Repeating Characters</a></th>
    <th>Easy</th>
  </tr>
  
  <tr>
    <th >917</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83743873">Reverse Only Letters</a></th>
    <th>Easy</th>
  </tr> <tr>
    <th >520</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83059879">Detect Capital</a></th>
    <th>Easy</th>
  </tr> <tr>
    <th >541</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83048617">Reverse String II</a></th>
    <th>Easy</th>
  </tr>
  
  <tr>
    <th >66</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84542375">Plus one</a></th>
    <th>Easy</th>
  </tr> 
  
   <tr>
    <th >647</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84843605">Palindromic Substrings</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >438</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84842726">Find All Anagrams in a String</a></th>
    <th>Easy</th>
  </tr>
  
   <tr>
    <th >67</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104173291">Add Binary</a></th>
    <th>Easy</th>
  </tr>
</table>

## 4.hashtable
<table border="2" >
  <tr align="center" >
    <th width="300">题号</th>
    <th width="300">题目内容</th>
    <th width="300">题目难度</th>   
  </tr>
   <tr>
    <th >1</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83023107">Two Sum</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th>3</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/81868702">Pairs Of Parentheses</a></th>
    <th>Middle</th>
  </tr>
  <tr>
    <th >48</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84985595"> Rotate Image</a></th>
    <th>Middle</th>
  </tr>
 
  <tr>
    <th >461</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84614747">Hamming Distance</a></th>
    <th>Easy</th>
  </tr> <tr>
    <th >771</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84567745">Jewels and Stones</a></th>
    <th>Easy</th>
  </tr> 
  <tr>
    <th >167</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84561249">Two Sum II - Input array is sorted</a></th>
    <th>Easy</th>
  </tr> 
</table>

## 5.math

<table border="2" >
  <tr align="center" >
    <th width="300">题号</th>
    <th width="300">题目内容</th>
    <th width="300">题目难度</th>   
  </tr>
  <tr>
    <th >258</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104189181">Add Digits</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >1154</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/104271703">Day Of Year</a></th>
    <th>Easy</th>
  </tr>
</table>

## 6.tree

<table border="2" >
  <tr align="center" >
    <th width="300">题号</th>
    <th width="300">题目内容</th>
    <th width="300">题目难度</th>   
  </tr>
  <tr>
    <th >94</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/106929330">Binary Tree Inorder Traversal</a></th>
    <th>Easy</th>
  </tr>
 
  <tr>
    <th >144</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/108887475">Binary Tree PreOrder Traversal</a></th>
    <th>Middle</th>
  </tr>
  
   <tr>
    <th >145</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/108884911">Binary Tree Post Order Traversal</a></th>
    <th>Middle</th>
  </tr>
   <tr>
    <th >236</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85164131">Lowest Common Ancestor of a Binary Tree</a></th>
    <th>Middle</th>
  </tr>
   <tr>
    <th >*337</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85050118">House Robber III</a></th>
    <th>Middle</th>
  </tr>
  <tr>
    <th >102</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85049161">Binary Tree Level Order Traversal</a></th>
    <th>Middle</th>
  </tr>
  
   <tr>
    <th >94</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85046785">Binary Tree Inorder Traversal</a></th>
    <th>Middle</th>
  </tr>
 
  <tr>
    <th >538</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84863120">Convert BST to Greater Tree</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >572</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84861633">Subtree of Another Tree</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >543</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84861015">Diameter of Binary Tree</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >101</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84859674">Symmetric Tree</a></th>
    <th>Easy</th>
  </tr>
  
   <tr>
    <th >226</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84653895">Invert Binary Tree</a></th>
    <th>Easy</th>
  </tr>
   <tr>
    <th >104</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84635662">Maximum Depth of Binary Tree</a></th>
    <th>Easy</th>
  </tr> <tr>
    <th >617</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84633192">Merge Two Binary Trees</a></th>
    <th>Easy</th>
  </tr> 
   <tr>
    <th >*606</th>
    <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84304381">Construct String from Binary Tree</a></th>
    <th>Easy</th>
  </tr> 
</table>

leetcode

파일 탐색기

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

leetcode

파일 탐색기

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README