|
3 | 3 | [](https://996.icu)
|
4 | 4 |
|
5 | 5 | ## 说明
|
6 |
| -- leetcode练习,坚持每天一道,目前已完成212道 |
| 6 | +- leetcode练习,坚持每天一道,目前已完成213道 |
7 | 7 | - 解题语言是Java
|
8 | 8 | - 每道题都是可编译运行的
|
9 | 9 | - 每道题有自己的方法和他人优秀解法
|
|
17 | 17 |
|
18 | 18 | - [x] [560. 和为K的子数组-Medium ](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_560_subarraySum.java)
|
19 | 19 |
|
20 |
| -- [ ] [581. 最短无序连续子数组 ——Easy](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/) |
| 20 | +- [x] [581. 最短无序连续子数组 ——Easy](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_581_findUnsortedSubarray.java) |
21 | 21 |
|
22 | 22 | - [ ] [617. 合并二叉树 -Easy](https://leetcode-cn.com/problems/merge-two-binary-trees/)
|
23 | 23 |
|
|
60 | 60 | - [线段树](https://leetcode-cn.com/tag/segment-tree/)(9)
|
61 | 61 | - [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree/)(15)
|
62 | 62 |
|
63 |
| -### 题目列表(更新中—已完成212) |
| 63 | +### 题目列表(更新中—已完成213) |
64 | 64 |
|
65 |
| -[Leetcode-Java(200+题解,持续更新、欢迎star)](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_560_subarraySum.java) |
| 65 | +[Leetcode-Java(200+题解,持续更新、欢迎star)](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_581_findUnsortedSubarray.java) |
66 | 66 |
|
67 | 67 | | No | 题目 | 解决方案 | 相关话题 | 难度 | remark |
|
68 | 68 | | ----- | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | ------ | ------------------------------------------------------------ |
|
|
258 | 258 | | #560 | [和为K的子数组](https://leetcode-cn.com/problems/subarray-sum-equals-k/) | [SubarraySum](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_560_subarraySum.java) | [数组](<https://leetcode-cn.com/tag/array/>)、[哈希表](<https://leetcode-cn.com/tag/hash-table/>) | Medium | |
|
259 | 259 | | #563 | [二叉树的坡度](https://leetcode-cn.com/problems/binary-tree-tilt/) | [FindTilt](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_563_findTilt.java) | [树](https://leetcode-cn.com/tag/tree/) | Easy | |
|
260 | 260 | | #567 | [字符串的排列](https://leetcode-cn.com/problems/permutation-in-string/) | [CheckInclusion](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_567_checkInclusion.java) | [双指针](<https://leetcode-cn.com/tag/two-pointers/>) | Medium | |
|
| 261 | +| #581 | [最短无序连续子数组](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/) | [FindUnsortedSubarray](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_581_findUnsortedSubarray.java) | [数组](<https://leetcode-cn.com/tag/array/>) | Easy | | |
261 | 262 | | #639 | [解码方法 2](https://leetcode-cn.com/problems/decode-ways-ii/) | [NumDecodings](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_639_numDecodings.java) | [动态规划](<https://leetcode-cn.com/tag/dynamic-programming/>) | Hard | |
|
262 | 263 | | #653 | [两数之和 IV - 输入 BST](https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst/) | [FindTarget](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_653_findTarget.java) | [树](https://leetcode-cn.com/tag/tree/) | Easy | |
|
263 | 264 | | #674 | [最长连续递增序列](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/) | [FindLengthOfLCIS](https://github.com/pphdsny/Leetcode-Java/blob/master/src/pp/arithmetic/leetcode/_674_findLengthOfLCIS_e.java) | [数组](<https://leetcode-cn.com/tag/array/>) | Easy | |
|
|
0 commit comments