java递归 zimu_README.md

最新推荐文章于 2023-08-31 16:27:40 发布

愙賗

最新推荐文章于 2023-08-31 16:27:40 发布

阅读量139

点赞数

文章标签： java递归 zimu

本文链接：https://blog.csdn.net/weixin_30783611/article/details/114716977

版权

# leetcode

#### 1~299

| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 |

|--------|--------|------------|----------|---------|--------|

| √ |1|[两数之和](https://leetcode.com/problems/two-sum/) | [java](src/main/java/com/dh/leetcode/zero/_1_TwoSum.java)|数组|Easy|

| √ |2|[两数相加](https://leetcode.com/problems/add-two-numbers/) | [java](src/main/java/com/dh/leetcode/zero/_2_AddTwoNumbers.java)|链表|Medium|

| √ |3|[无重复字符的最长子串](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [java](src/main/java/com/dh/leetcode/zero/_3_LongestSubstring.java)|数组|Medium|

| - |5|[最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/) | [java](src/main/java/com/dh/leetcode/zero/_5_LongestPalindromicSubstring.java)|数组|Medium|

| √ |7|[整数反转](https://leetcode-cn.com/problems/reverse-integer/)| [java](src/main/java/com/dh/leetcode/zero/_7_ReverseInteger.java)|数组|Easy|

| √ |12|[整数反转](https://leetcode.com/problems/integer-to-roman)| [java](src/main/java/com/dh/leetcode/zero/_12_IntegerToRoman.java)|字符串|Medium|

| √ |13|[罗马数字转整数](https://leetcode.com/problems/roman-to-integer)| [java](src/main/java/com/dh/leetcode/zero/_13_RomanToInteger.java)|散列表|Easy|

| √ |15|[三数之和](https://leetcode.com/problems/3sum) | [java](src/main/java/com/dh/leetcode/zero/_15_3Sum.java)|散列表|Medium|

| √ |17|[电话号码的字母组合](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [java](src/main/java/com/dh/leetcode/zero/_17_LetterCombinationsofaPhoneNumber)|回溯法|Medium|

| √ |19|[删除链表的倒数第N个节点](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [java](src/main/java/com/dh/leetcode/zero/_19_RemoveNthNodeFromEndOfList.java)|链表|Medium|

| √ |20|[有效的括号](https://leetcode.com/problems/valid-parentheses/)| [java](src/main/java/com/dh/leetcode/zero/_20_ValidParentheses.java)|栈/迭代|Easy|

| √ |21|[合并两个有序链表](https://leetcode.com/problems/merge-two-sorted-lists)| [java](src/main/java/com/dh/leetcode/zero/_21_MergeTwoSortedLists.java)| 链表 |Easy|

| √ |24|[两两交换链表中的节点](https://leetcode.com/problems/remove-element) | [java](src/main/java/com/dh/leetcode/zero/_24_SwapNodesInPairs.java)| 链表 |Medium|

| - |34|[查找有序数组中第一和最后一个位置](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [java](src/main/java/com/dh/leetcode/zero/_34_FindFirstandLastPositionofElementinSortedArray.java)| 二分法 |Medium|

| √ |39|[组合总和](https://leetcode-cn.com/problems/combination-sum/)| [java](src/main/java/com/dh/leetcode/zero/_39_CombinationSum.java)| 回溯法 |Medium|

| √ |39|[组合总和2](https://leetcode-cn.com/problems/combination-sum-ii/)| [java](src/main/java/com/dh/leetcode/zero/_40_CombinationSumII.java)| 回溯法 |Medium|

| √ |46|[全排列](https://leetcode-cn.com/problems/permutations/)| [java](src/main/java/com/dh/leetcode/zero/_46_Permutations.java)| 回溯法 |Medium|

| √ |49|[字母异位词分组](https://leetcode.com/problems/group-anagrams) | [java](src/main/java/com/dh/leetcode/zero/_49_GroupAnagrams.java)| 散列表 |Medium|

| √ |58|[最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word/)| [java](src/main/java/com/dh/leetcode/zero/_58_LengthofLastWord.java)| 遍历 |Easy|

| √ |66|[加1](https://leetcode.com/problems/plus-one)| [java](src/main/java/com/dh/leetcode/zero/_66_PlusOne.java)| 大数 |Easy|

| √ |67|[二进制求和](https://leetcode.com/problems/add-binary)| [java](src/main/java/com/dh/leetcode/zero/_67_AddBinary.java)| 二进制 |Easy|

| √ |69|[x的平方根](https://leetcode.com/problems/sqrtx)| [java](src/main/java/com/dh/leetcode/zero/_69_SqrtX.java)| 二分法 |Easy|

| √ |78|[数组的子集合](https://leetcode.com/problems/subsets/)| [java](src/main/java/com/dh/leetcode/zero/_78_Subsets.java)| 位运算 |Medium|

| √ |94|[二叉树中序非递归输出](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [java](src/main/java/com/dh/leetcode/zero/_94_BinaryTreeInorderTraversal.java)| 栈/迭代 |Medium|

| √ |101|[对称二叉树](https://leetcode.com/problems/symmetric-tree/) | [java](src/main/java/com/dh/leetcode/one/_101_SymmetricTree.java)| 数/递归 |Easy|

| √ |103|[二叉树的锯齿形层序遍历](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/) | [java](src/main/java/com/dh/leetcode/one/_103_binary_tree_zigzag_level_order_traversal.java)| 队列广度优先/list倒置 |简单 |

| √ |118|[杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/) | [java](src/main/java/com/dh/leetcode/one/_118_Pascals_triangle.java)| 循环 |Easy |

| √ |119|[杨辉三角2](https://leetcode-cn.com/problems/pascals-triangle-ii/) | [java](src/main/java/com/dh/leetcode/one/_119_Pascals_triangle_ii.java)| 灌水 |Easy |

| √ |121|[股票最佳买卖时间1](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [java](src/main/java/com/dh/leetcode/one/_121_BestTimetoBuyandSellStock.java)| 迭代 |Easy |

| √ |134|[加油站](https://leetcode-cn.com/problems/gas-station)| [java](src/main/java/com/dh/leetcode/one/_134_Gas_station.java)| 暴力 |简单 |

| √ |136|[只出现一次的数字](https://leetcode.com/problems/single-number/) | [java](src/main/java/com/dh/leetcode/one/_136_SingleNumber.java)| 散列表 |Easy |

| √ |142|[环形链表II](https://leetcode.com/problems/linked-list-cycle-ii)|[java](src/main/java/com/dh/leetcode/one/_142_Linked_List_Cycle_ii.java)|Set|Medium|

| √ |147|[对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list/)|[java](src/main/java/com/dh/leetcode/one/_147_Insertion_sort_list.java)|链表|中等|

| √ |160|[相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/)|[java](src/main/java/com/dh/leetcode/one/_160_intersection_of_two_linked_lists.java)|链表 hash 暴力|简单|

| √ |168|[Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/)|[java](src/main/java/com/dh/leetcode/one/_168_excel_sheet_column_title.java)|10进制转26|Easy|

| √ |169|[求众数](https://leetcode.com/problems/majority-element)|[java](src/main/java/com/dh/leetcode/one/_169_MajorityElement.java)|散列表|Easy|

| - |169|[股票最佳买卖时间4](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv)|[java](src/main/java/com/dh/leetcode/one/)|散列表|Easy|

| √ |171|[26进制](https://leetcode.com/problems/excel-sheet-column-number/)|[java](src/main/java/com/dh/leetcode/one/_171_ExcelSheetColumnNumber.java)|数组|Easy|

| √ |202|[快乐数字](https://leetcode.com/problems/happy-number)|[java](src/main/java/com/dh/leetcode/two/_202_HappyNumber.java)|Set|Easy|

| √ |205|[同构字符串](https://leetcode-cn.com/problems/isomorphic-strings/)|[java](src/main/java/com/dh/leetcode/two/_205_isomorphic_strings.java)|Set|Easy|

| √ |206|[反转链表](https://leetcode.com/problems/reverse-linked-list)|[java](src/main/java/com/dh/leetcode/two/_206_ReverseLinkedList.java)|链表|Easy|

| √ |208|[实现字典数](https://leetcode.com/problems/implement-trie-prefix-tree)|[java](src/main/java/com/dh/leetcode/two/_208_ImplementTrie.java)|字典树|Medium|

| √ |209|[单词规律](https://leetcode-cn.com/problems/word-pattern)|[java](src/main/java/com/dh/leetcode/two/_209_word_pattern.java)|hash|简单|

| √ |217|[数组是否包含重复项](https://leetcode.com/problems/contains-duplicate/)|[java](src/main/java/com/dh/leetcode/two/_217_ContainsDuplicate.java)|字典树|Easy|

| √ |222|[完全二叉树的节点个数](https://leetcode-cn.com/problems/count-complete-tree-nodes/)|[java](src/main/java/com/dh/leetcode/two/_222_Count_complete_tree_nodes.java)|遍历树|简单|

| √ |223|[矩形面积](https://leetcode-cn.com/problems/rectangle-area/)|[java](src/main/java/com/dh/leetcode/two/_223_rectangle_area.java)|相交判断|简单|

| √ |226|[反转二叉树](https://leetcode.com/problems/invert-binary-tree)|[java](src/main/java/com/dh/leetcode/two/_226_InvertBinaryTree.java)|递归|Easy|

| √ |232|[用栈实现队列](https://leetcode.com/problems/implement-queue-using-stacks)|[java](src/main/java/com/dh/leetcode/two/_232_ImplementQueueusingStacks.java)|两个栈|Easy|

| √ |237|[删除链接列表中的节点](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[java](src/main/java/com/dh/leetcode/two/_237_DeleteNodeinaLinkedList.java)|链表|Easy|

| √ |242|[有效的字母异位词](https://leetcode.com/problems/valid-anagram)|-|[java](src/main/java/com/dh/leetcode/two/_242_ValidAnagram.java)|-|Easy|

| √ |260|[只出现一次的数字III](https://leetcode.com/problems/single-number-iii)|-|[java](src/main/java/com/dh/leetcode/two/_260_SingleNumberIII.java)| 散列表|Medium|

#### 300~599

| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 |

|--------|--------|-----------|---------|---------|--------|

| √ |328|[奇偶链表](https://leetcode-cn.com/problems/odd-even-linked-list)|[java](src/main/java/com/dh/leetcode/three/_328_OddEvenLinkedList.java)|链表|中等|

| √ |344|[反转字符串](https://leetcode.com/problems/reverse-string)|[java](src/main/java/com/dh/leetcode/three/_344_ReverseString.java)|数组|Easy|

| √ |349|[两个数组的交集](https://leetcode-cn.com/problems/intersection-of-two-arrays/)|[java](src/main/java/com/dh/leetcode/three/_349_IntersectionOfTwoArrays)|数组|Easy|

| √ |367|[有效的完全平方数](https://leetcode.com/problems/valid-perfect-square)|[java](src/main/java/com/dh/leetcode/three/_367_ValidPerfectSquare.java)|二分法 | Easy|

| - |371|[不使用运算符加两个数](https://leetcode.com/problems/sum-of-two-integers/)|[java](src/main/java/com/dh/leetcode/three/_371_SumofTwoIntegers.java)|位运算 | Easy|

| √ |383|[赎金信](https://leetcode-cn.com/problems/ransom-note/)|[java](src/main/java/com/dh/leetcode/three/_383_ransom_note.java)|桶/数组 | Easy|

| √ |435|[无重叠区间](https://leetcode-cn.com/problems/non-overlapping-intervals/)|[java](src/main/java/com/dh/leetcode/four/_435_non_overlapping_intervals.java)|排序/贪心 | 中等|

| √ |448|[找到所有数组中消失的数字](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/)|[java](src/main/java/com/dh/leetcode/four/_448_find_all_numbers_disappeared_in_an_array.java)|桶/hash | 中等|

| √ |452|[用最少数量的箭引爆气球](https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons)|[java](src/main/java/com/dh/leetcode/four/_452_Minimum_number_of_arrows_to_burst_balloons.java)|排序 | 困难|

| √ |455|[分发饼干](https://leetcode-cn.com/problems/assign-cookies/)|[java](src/main/java/com/dh/leetcode/four/_455_assign_cookies.java)| 排序贪心 | 简单|

| √ |463|[岛屿的周长](https://leetcode-cn.com/problems/island-perimeter)|[java](src/main/java/com/dh/leetcode/four/_463_landPerimeter.java)|数组 | Easy|

| √ |485|[最大连续1的个数](https://leetcode-cn.com/problems/max-consecutive-ones/)|[java](src/main/java/com/dh/leetcode/four/_485_max_consecutive_ones.java)|数组 | Easy|

| √ |509|[斐波那契数列](https://leetcode.com/problems/fibonacci-number)|[java](src/main/java/com/dh/leetcode/five/_509_FibonacciNumber.java)| 数组 |Easy|

| √ |567|[字符串的排列](https://leetcode-cn.com/problems/permutation-in-string/)|[java](src/main/java/com/dh/leetcode/five/_567_permutation_in_string.java)| 数组/滑动窗口 |中等|

| √ |599|[两个列表的最小索引总和](https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists)|[java](src/main/java/com/dh/leetcode/five/_599_minimum_index_sum_of_two_lists.java)| 数组 |Easy|

#### 600~999

| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 |

|--------|--------|--------|----------|---------|--------|

| √ |628|[三个数的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-three-numbers/)|[java](src/main/java/com/dh/leetcode/six/_628_maximum_product_of_three_numbers.java)| 排序 |Easy|

| √ |649|[Dota2参议院](https://leetcode-cn.com/problems/dota2-senate)|[java](src/main/java/com/dh/leetcode/six/_649_dota2_senate.java)| 贪心 |Easy|

| √ |700|[二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)|[java](src/main/java/com/dh/leetcode/seven/_700_search_in_a_binary_search_tree.java)| 树遍历 |Easy|

| √ |771|[宝石与石头](https://leetcode-cn.com/problems/jewels-and-stones/)|[java](src/main/java/com/dh/leetcode/seven/_771_jewels_and_stones.java)| 桶/数组 |Easy|

| √ |844|[比较含退格的字符串](https://leetcode-cn.com/problems/backspace-string-compare/)|[java](src/main/java/com/dh/leetcode/eight/_844_BackspaceCompare.java)|数组 | Easy|

| √ |860|[柠檬水找零](https://leetcode-cn.com/problems/lemonade-change)|[java](src/main/java/com/dh/leetcode/eight/_860_lemonade_change.java)|桶/贪心 | Easy|

| √ |867|[转置矩阵](https://leetcode-cn.com/problems/transpose-matrix/)|[java](src/main/java/com/dh/leetcode/eight/_867_transpose_matrix.java)|行转列 | Easy|

| √ |976|[三角形的最大周长](https://leetcode-cn.com/problems/largest-perimeter-triangle/)|[java](src/main/java/com/dh/leetcode/nine/_976_largest_perimeter_triangle.java)|排序 | Easy|

#### k1~k2

| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 |

|--------|--------|--------|----------|---------|--------|

| √ |1030|[距离顺序排列矩阵单元格](https://leetcode-cn.com/problems/matrix-cells-in-distance-order/)|[java](src/main/java/com/dh/leetcode/k1/_1030_Matrix_cells_in_distance_order.java)|暴力 | Easy|

| √ |1114|[按序打印](https://leetcode-cn.com/problems/print-in-order/)|[java](src/main/java/com/dh/leetcode/k1/_1114_print_in_order.java)|CountdownLatch | 中等 |

| √ |1122|[数组的相对排序](https://leetcode-cn.com/problems/relative-sort-array/)|[java](src/main/java/com/dh/leetcode/k1/_1122_Relative_sort_array.java)|暴力 | Easy|

| √ |1052|[爱生气的书店老板](https://leetcode-cn.com/problems/grumpy-bookstore-owner/)|[java](src/main/java/com/dh/leetcode/k1/_1052_grumpy_bookstore_owner.java)|滑动窗口 | 中等|

| √ |1356|[二进制1个数排序](https://leetcode-cn.com/problems/sort-integers-by-the-number-of-1-bits)|[java](src/main/java/com/dh/leetcode/k1/_1356_Sort_integers_by_the_number_of_1_bits.java)|位运算 | Easy|

| √ |1370|[上升下降字符串](https://leetcode-cn.com/problems/increasing-decreasing-string/)|[java](src/main/java/com/dh/leetcode/k1/_1370_Increasing_decreasing_string.java)|堆排序 | Easy|

| √ |1423|[可获得的最大点数](https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards/)|[java](src/main/java/com/dh/leetcode/k1/_1423_maximum_points_you_can_obtain_from_cards.java)|滑动窗口 | 中等|

#### 剑指offer

| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 |

|--------|--------|--------|----------|---------|--------|

一键复制

编辑

Web IDE

原始数据

按行查看

历史

愙賗

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
java递归 zimu_README.md

# leetcode#### 1~299| 状态 | 序号 | 标题来源 | 语言 | 解法 | 难度 ||--------|--------|------------|----------|---------|--------|| √ |1|[两数之和](https://leetcode.com/problems/two-sum/) | [java](sr...
复制链接

扫一扫