[leetcode]: 刷题目录

女爷i 2022-06-15 11:17 255阅读 0赞

题目分类，博客对应连接，方便查找

# 1.树 #

**路径和**  
[112. Path Sum][]

[437. Path Sum III][]

**遍历**  
[104. Maximum Depth of Binary Tree][]

[107. Binary Tree Level Order Traversal II][]  
[111. Minimum Depth of Binary Tree][]

[257. Binary Tree Paths][]  
[404. Sum of Left Leaves][]  
[501. Find Mode in Binary Search Tree][]

[543.Diameter of Binary Tree][]  
[563. Binary Tree Tilt][]  
[606. Construct String from Binary Tree][]  
[617. Merge Two Binary Trees][]  
[513. Find Bottom Left Tree Value][]  
[538. Convert BST to Greater Tree][]  
[508. Most Frequent Subtree Sum][]  
[94. Binary Tree Inorder Traversal][]  
[623 Add One Row to Tree][]

**树的结构**

[100. Same Tree][]  
[101. Symmetric Tree][]  
[110. Balanced Binary Tree][]  
[226. Invert Binary Tree][]

**二叉搜索树BST**  
[108. Convert Sorted Array to Binary Search Tree][]  
[235. Lowest Common Ancestor of a Binary Search Tree][]

# 2.字符串 #

[557. Reverse Words in a String III][]  
[551. Student Attendance Record I][]  
[541. Reverse String II][]  
[521. Longest Uncommon Subsequence I][]  
[520. Detect Capital][]  
434. Number of Segments in a String\#还没写  
[383. Ransom Note][]  
[345. Reverse Vowels of a String][]  
[344. Reverse String][]  
91. Decode Ways\#还没写  
[38. Count and Say][]  
[13. Roman to Integer][]

# 3.链表 #

237.Delete Node in a Linked List\#还没写  
206.Reverse Linked List\#还没写  
[203. Remove Linked List Elements][]  
[160. Intersection of Two Linked Lists][]

[141. Linked List Cycle][]  
[83. Remove Duplicates from Sorted List][]  
[21. Merge Two Sorted Lists][]

# 4.动态规划 #

[198. House Robber][]  
[121. Best Time to Buy and Sell Stock][]  
91. Decode Ways\#还没写  
[70. Climbing Stairs][]  
[53. Maximum Subarray][]  
[338. Counting Bits][]

[112. Path Sum]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72835210
[437. Path Sum III]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72825907
[104. Maximum Depth of Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72241693
[107. Binary Tree Level Order Traversal II]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72639691
[111. Minimum Depth of Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72845214
[257. Binary Tree Paths]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72784254
[404. Sum of Left Leaves]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72285158
[501. Find Mode in Binary Search Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72717289
[543.Diameter of Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72466308
[563. Binary Tree Tilt]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72281980
[606. Construct String from Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73331007
[617. Merge Two Binary Trees]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73312814
[513. Find Bottom Left Tree Value]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73550865
[538. Convert BST to Greater Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73656685
[508. Most Frequent Subtree Sum]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73657266
[94. Binary Tree Inorder Traversal]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73692531
[623 Add One Row to Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73692428
[100. Same Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72403741
[101. Symmetric Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72675122
[110. Balanced Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72711095
[226. Invert Binary Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72835655
[108. Convert Sorted Array to Binary Search Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72633942
[235. Lowest Common Ancestor of a Binary Search Tree]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72784564
[557. Reverse Words in a String III]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/71036343
[551. Student Attendance Record I]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72403907
[541. Reverse String II]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72456023
[521. Longest Uncommon Subsequence I]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72286395
[520. Detect Capital]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/71075337
[383. Ransom Note]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/71124134
[345. Reverse Vowels of a String]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72745216
[344. Reverse String]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/71037102
[38. Count and Say]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72809159
[13. Roman to Integer]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/71176913
[203. Remove Linked List Elements]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72854910
[160. Intersection of Two Linked Lists]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72859023
[141. Linked List Cycle]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72814620
[83. Remove Duplicates from Sorted List]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72588389
[21. Merge Two Sorted Lists]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72610523
[198. House Robber]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72807124
[121. Best Time to Buy and Sell Stock]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72567696
[70. Climbing Stairs]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72592263
[53. Maximum Subarray]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/72599455
[338. Counting Bits]: http://blog.csdn.net/my_lovely_lemon_tree/article/details/73550116