|
1 | 1 | # LeetCode-Java |
2 | 2 | [](https://996.icu) |
3 | 3 | ## 说明 |
4 | | -个人练习leetcode记录，坚持每天一道，欢迎交流! |
| 4 | +- leetcode练习，坚持每天一道 |
| 5 | +- 解题语言是Java |
| 6 | +- 每道题都是可编译运行的 |
| 7 | +- 每道题都有自己笨笨的方法和他人优秀解法 |
| 8 | +- 欢迎fork、交流，一起互勉 |
5 | 9 | ## 网站 |
6 | 10 | https://leetcode-cn.com/ |
| 11 | +## 已解题目 |
| 12 | +### 题目类型 |
| 13 | + |
| 14 | +- [数组](<https://leetcode-cn.com/tag/array/>) |
| 15 | +- [哈希表](<https://leetcode-cn.com/tag/hash-table/>) |
| 16 | +- [动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>) |
| 17 | +- [双指针](<https://leetcode-cn.com/tag/two-pointers/>) |
| 18 | +- [字符串](<https://leetcode-cn.com/tag/string/>) |
| 19 | +- [数学](<https://leetcode-cn.com/tag/math/>) |
| 20 | +- [sliding window](<https://leetcode-cn.com/tag/sliding-window/>) |
| 21 | +- [二分查找](<https://leetcode-cn.com/tag/binary-search/>) |
| 22 | +- [分治算法](<https://leetcode-cn.com/tag/divide-and-conquer/>) |
| 23 | +- [回溯算法](<https://leetcode-cn.com/tag/backtracking/>) |
| 24 | +- [链表](https://leetcode-cn.com/tag/linked-list/) |
| 25 | +- [堆](https://leetcode-cn.com/tag/heap/) |
| 26 | + |
| 27 | +### 题目列表 |
| 28 | + |
| 29 | +| No | 题目 | 解决方案 | 相关话题 | 难度 | remark | |
| 30 | +| ---- | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | ------ | ------------------------------------------------------------ | |
| 31 | +| #1 | [两数之和](https://leetcode-cn.com/problems/two-sum) | [TwoSum](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_1_twoSum.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[哈希表](<https://leetcode-cn.com/tag/hash-table/>) | Easy | | |
| 32 | +| #2 | [两数相加](https://leetcode-cn.com/problems/add-two-numbers/) | [AddTwoNumbers](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_2_addTwoNumbers.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[数学](<https://leetcode-cn.com/tag/math/>) | Easy | | |
| 33 | +| #3 | [无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/) | [LengthOfLongestSubstring](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_3_lengthOfLongestSubstring.java) | [哈希表](<https://leetcode-cn.com/tag/hash-table/>)、[双指针](<https://leetcode-cn.com/tag/two-pointers/>)、[字符串](<https://leetcode-cn.com/tag/string/>)、[sliding window](<https://leetcode-cn.com/tag/sliding-window/>) | Medium | | |
| 34 | +| #4 | [寻找两个有序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/) | [FindMedianSortedArrays](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_4_findMedianSortedArrays_2.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[二分查找](<https://leetcode-cn.com/tag/binary-search/>)、[分治算法](<https://leetcode-cn.com/tag/divide-and-conquer/>) | Hard | [自己原始解法](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_4_findMedianSortedArrays.java) | |
| 35 | +| #5 | [最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/) | [LongestPalindrome](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_5_longestPalindrome.java) | [字符串](<https://leetcode-cn.com/tag/string/>)、[动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>) | Medium | | |
| 36 | +| #6 | [Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion/) | [Convert](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_6_convert_2.java) | [字符串](<https://leetcode-cn.com/tag/string/>) | Medium | | |
| 37 | +| #7 | [整数反转](https://leetcode-cn.com/problems/reverse-integer/) | [Reverse](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_7_reverse.java) | [数学](<https://leetcode-cn.com/tag/math/>) | Easy | | |
| 38 | +| #8 | [字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/) | [MyAtoi](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_8_myAtoi.java) | [字符串](<https://leetcode-cn.com/tag/string/>)、[数学](<https://leetcode-cn.com/tag/math/>) | Medium | | |
| 39 | +| #9 | [回文数](https://leetcode-cn.com/problems/palindrome-number/) | [IsPalindrome](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_9_isPalindrome.java) | [数学](<https://leetcode-cn.com/tag/math/>) | Easy | | |
| 40 | +| #10 | [正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching/) | [IsMatch](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_10_isMatch_2.java) | [字符串](<https://leetcode-cn.com/tag/string/>)、[动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>)、[回溯算法](<https://leetcode-cn.com/tag/backtracking/>) | Hard | [自己原始解法](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_10_isMatch.java) | |
| 41 | +| #11 | [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/) | [MaxArea](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_11_maxArea.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[双指针](<https://leetcode-cn.com/tag/two-pointers/>) | Medium | | |
| 42 | +| #14 | [最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/) | [LongestCommonPrefix](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_14_longestCommonPrefix.java) | [字符串](<https://leetcode-cn.com/tag/string/>) | Easy | | |
| 43 | +| #15 | [三数之和](https://leetcode-cn.com/problems/3sum/) | [ThreeSum](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_15_threeSum.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[双指针](<https://leetcode-cn.com/tag/two-pointers/>) | Medium | | |
| 44 | +| #19 | [删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/) | [RemoveNthFromEnd](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_19_RemoveNthFromEnd.java) | [链表](https://leetcode-cn.com/tag/linked-list/)、[双指针](<https://leetcode-cn.com/tag/two-pointers/>) | Medium | | |
| 45 | +| #21 | [合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/) | [MergeTwoLists](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_21_MergeTwoLists.java) | [链表](https://leetcode-cn.com/tag/linked-list/) | Easy | | |
| 46 | +| #22 | [括号生成](https://leetcode-cn.com/problems/generate-parentheses/) | [GenerateParenthesis](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_22_generateParenthesis.java) | [字符串](<https://leetcode-cn.com/tag/string/>)、[回溯算法](<https://leetcode-cn.com/tag/backtracking/>) | Medium | | |
| 47 | +| #23 | [合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/) | [MergeKLists](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_23_mergeKLists.java) | [堆](https://leetcode-cn.com/tag/heap/)、[链表](https://leetcode-cn.com/tag/linked-list/)、[分治算法](<https://leetcode-cn.com/tag/divide-and-conquer/>) | Hard | | |
| 48 | +| #24 | [两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/) | [SwapPairs](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_24_SwapPairs.java) | [链表](https://leetcode-cn.com/tag/linked-list/) | Medium | | |
| 49 | +| #25 | [k个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/) | [ReverseKGroup](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_25_reverseKGroup.java) | [链表](https://leetcode-cn.com/tag/linked-list/) | Hard | | |
| 50 | +| #26 | [删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/) | [RemoveDuplicates](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_26_removeDuplicates.java) | [链表](https://leetcode-cn.com/tag/linked-list/)、[双指针](<https://leetcode-cn.com/tag/two-pointers/>) | Easy | | |
| 51 | +| #33 | [搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/) | [Search](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_33_search.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[二分查找](<https://leetcode-cn.com/tag/binary-search/>) | Medium | | |
| 52 | +| #34 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [SearchRange](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_34_searchRange.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[二分查找](<https://leetcode-cn.com/tag/binary-search/>) | Medium | | |
| 53 | +| #35 | [搜索插入位置](https://leetcode-cn.com/problems/search-insert-position/) | [SearchInsert](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_35_searchInsert.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[二分查找](<https://leetcode-cn.com/tag/binary-search/>) | Easy | | |
| 54 | +| #40 | [组合总和 II](https://leetcode-cn.com/problems/combination-sum-ii/) | [CombinationSum2](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_40_combinationSum2.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[回溯算法](<https://leetcode-cn.com/tag/backtracking/>) | Medium | | |
| 55 | +| #304 | [二维区域和检索 - 矩阵不可变](https://leetcode-cn.com/problems/range-sum-query-2d-immutable/) | [NumMatrix]() | [动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>) | Medium | | |
| 56 | + |
| 57 | + |
| 58 | + |
| 59 | + |
0 commit comments