|
1 | 1 | # LeetCode-Java |
2 | 2 | ## 说明 |
3 | | -- leetcode练习，坚持每天一道，目前已完成249道 |
| 3 | +- leetcode练习，坚持每天一道，目前已完成250道 |
4 | 4 | - 解题语言是Java |
5 | 5 | - 每道题都是可编译运行的 |
6 | 6 | - 每道题有自己的方法和他人优秀解法 |
|
20 | 20 |
|
21 | 21 | - [x] [130. 被围绕的区域](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_130_solve.java) |
22 | 22 |
|
23 | | -- [ ] [131. 分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/) |
| 23 | +- [x] [131. 分割回文串](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_131_partition.java) |
24 | 24 |
|
25 | 25 | - [ ] [132. 分割回文串 II](https://leetcode-cn.com/problems/palindrome-partitioning-ii/) |
26 | 26 |
|
|
59 | 59 | - [线段树](https://leetcode-cn.com/tag/segment-tree/)（9） |
60 | 60 | - [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree/)（15） |
61 | 61 |
|
62 | | -### 题目列表（更新中—已完成249） |
| 62 | +### 题目列表（更新中—已完成250） |
63 | 63 |
|
64 | | -[Leetcode-Java(240+题解，持续更新、欢迎star&留言&交流)](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_130_solve.java) |
| 64 | +[Leetcode-Java(250+题解，持续更新、欢迎star&留言&交流)](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_131_partition.java) |
65 | 65 |
|
66 | 66 | | No | 题目 | 解决方案 | 相关话题 | 难度 | 备注 | |
67 | 67 | | ----- | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | ------ | ------------------------------------------------------------ | |
|
195 | 195 | | #128 | [最长连续序列](https://leetcode-cn.com/problems/longest-consecutive-sequence/) | [LongestConsecutive](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_128_longestConsecutive.java) | [并查集](https://leetcode-cn.com/tag/union-find/)、[数组](<https://leetcode-cn.com/tag/array/>) | Hard | | |
196 | 196 | | #129 | [求根到叶子节点数字之和](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/) | [SumNumbers](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_129_sumNumbers.java) | [树](https://leetcode-cn.com/tag/tree/)、[DFS](https://leetcode-cn.com/tag/depth-first-search/) | Medium | | |
197 | 197 | | #130 | [被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions/) | [Solve](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_130_solve.java) | [BFS](https://leetcode-cn.com/tag/breadth-first-search/)、[DFS](https://leetcode-cn.com/tag/depth-first-search/)、[并查集](https://leetcode-cn.com/tag/union-find/) | Medium | | |
| 198 | +| #131 | [分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/) | [Partition](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_131_partition.java) | [回溯算法](<https://leetcode-cn.com/tag/backtracking/>) | Medium | | |
198 | 199 | | #136 | [只出现一次的数字](https://leetcode-cn.com/problems/single-number/) | [SingleNumber](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_136_singleNumber.java) | [哈希表](<https://leetcode-cn.com/tag/hash-table/>)、[位运算](https://leetcode-cn.com/tag/bit-manipulation/) | Easy | 位运算了解下 | |
199 | 200 | | #138 | [复制带随机指针的链表](https://leetcode-cn.com/problems/copy-list-with-random-pointer/) | [CopyRandomList](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_138_CopyRandomList.java) | [哈希表](<https://leetcode-cn.com/tag/hash-table/>)、[链表](https://leetcode-cn.com/tag/linked-list/) | Medium | | |
200 | 201 | | #139 | [单词拆分](https://leetcode-cn.com/problems/word-break/) | [WordBreak](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_139_wordBreak.java) | [动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>) | Medium | 回溯实现耗时 | |
|
0 commit comments