Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitedf7916

Browse files
author
luzhipeng
committed
1 parent2d1371c commitedf7916

11 files changed

+272
-16
lines changed

‎README.md

Lines changed: 19 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -69,23 +69,25 @@ leetcode 题解，记录自己的 leetcode 解题之路。
6969

7070
![koko-eating-bananas](./assets/problems/koko-eating-bananas.png)
7171

72-
##进度
72+
##Top题目进度
7373

74-
-[Top 100 Linked Questions](https://leetcode.com/problemset/top-100-liked-questions/)(44/100)
74+
-[Top 100 Linked Questions](https://leetcode.com/problemset/top-100-liked-questions/)(44 /100)
7575

76-
-[Top Interview Questions](https://leetcode.com/problemset/top-interview-questions/)(59/145)
76+
-[Top Interview Questions](https://leetcode.com/problemset/top-interview-questions/) (64 /145)
7777
##传送门
7878

7979
###leetcode 经典题目的解析
8080

81+
>这里仅列举具有代表性题目，并不是全部题目
82+
8183
####简单难度
8284

8385
-[0020.Valid Parentheses](./problems/20.validParentheses.md) 🖊
8486
-[0026.remove-duplicates-from-sorted-array](./problems/26.remove-duplicates-from-sorted-array.md)
85-
-[0088.merge-sorted-array](./problems/88.merge-sorted-array.md) 🆕
87+
-[0088.merge-sorted-array](./problems/88.merge-sorted-array.md)
8688
-[0136.single-number](./problems/136.single-number.md)
8789
-[0167.two-sum-ii-input-array-is-sorted](./problems/167.two-sum-ii-input-array-is-sorted.md)
88-
-[0169.majority-element](./problems/169.majority-element.md) 🆕
90+
-[0169.majority-element](./problems/169.majority-element.md)
8991
-[0190.reverse-bits](./problems/190.reverse-bits.md)
9092
-[0191.number-of-1-bits](./problems/191.number-of-1-bits.md)
9193
-[0203.remove-linked-list-elements](./problems/203.remove-linked-list-elements.md)
@@ -101,12 +103,13 @@ leetcode 题解，记录自己的 leetcode 解题之路。
101103
-[0002. Add Two Numbers](./problems/2.addTwoNumbers.md)
102104
-[0003. Longest Substring Without Repeating Characters](./problems/3.longestSubstringWithoutRepeatingCharacters.md)
103105
-[0011.container-with-most-water](./problems/11.container-with-most-water.md)
106+
-[0015.3-sum](./problems/15.3-sum.md) 🆕
104107
-[0019. Remove Nth Node From End of List](./problems/19.removeNthNodeFromEndofList.md)
105108
-[0024. Swap Nodes In Pairs](./problems/24.swapNodesInPairs.md)
106-
-[0039.combination-sum](./problems/39.combination-sum.md) 🆕
107-
-[0040.combination-sum-ii](./problems/40.combination-sum-ii.md) 🆕
108-
-[0046.permutations](./problems/46.permutations.md) 🆕
109-
-[0047.permutations-ii](./problems/47.permutations-ii.md) 🆕
109+
-[0039.combination-sum](./problems/39.combination-sum.md)
110+
-[0040.combination-sum-ii](./problems/40.combination-sum-ii.md)
111+
-[0046.permutations](./problems/46.permutations.md)
112+
-[0047.permutations-ii](./problems/47.permutations-ii.md)
110113
-[0055.jump-game](./problems/55.jump-game.md) 🆕
111114
-[0062.unique-paths](./problems/62.unique-paths.md)🆕
112115
-[0075.sort-colors](./problems/75.sort-colors.md)
@@ -134,6 +137,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
134137
-[0328.odd-even-linked-list](./problems/328.odd-even-linked-list.md)
135138
-[0416.partition-equal-subset-sum](./problems/416.partition-equal-subset-sum.md)
136139
-[0445.add-two-numbers-ii](./problems/445.add-two-numbers-ii.md)
140+
-[0454.4-sum-ii](./problems/454.4-sum-ii.md) 🆕
137141
-[0518.coin-change-2](./problems/518.coin-change-2.md)
138142
-[0875.koko-eating-bananas](./problems/875.koko-eating-bananas.md)
139143
-[0877.stone-game](./problems/877.stone-game.md)
@@ -205,3 +209,9 @@ anki - 文件 - 导入 - 下拉格式选择“打包的 anki集合”，然后
205209
![wechat-group-chat](./assets/wechat-group-chat.jpeg)
206210

207211
(由于微信的限制，100个人以上只能邀请加入， 你可以添加我的机器人回复“leetcode”拉你进群)
212+
213+
##贡献
214+
215+
- 如果有想法和创意，请提[issue](https://github.com/azl397985856/leetcode/issues)或者进群提
216+
- 如果想贡献代码，请提[PR](https://github.com/azl397985856/leetcode/pulls)
217+
- 如果需要修改项目中图片，[这里](./assets/drawio/)存放了项目中绘制图的源代码， 大家可以用[draw.io](https://www.draw.io/)打开进行编辑。

‎assets/drawio/15.3-sum.drawio

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
<mxfile modified="2019-05-03T09:30:51.254Z" host="www.draw.io" agent="Mozilla/5.0 (Macintosh; Intel Mac OS X 10_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/73.0.3683.86 Safari/537.36" etag="TW5ym4u-7gh4PydZElOX" version="10.6.6" type="device"><diagram id="b_2AcDZds6F21w0ZimBd" name="第 1 页">7ZpRb5swEMc/jaXtYREYHMhjoUn7sGqVsmnqXiYHnMAKGIHTpPv0M2CSgGnXbgk4UlIphbPB+Pc/uDsTYLjx9ibDaXBHfRIBqPlbYFwDCCe6zb8Lw3NlQLpWGVZZ6FcmfW+Yh7+JMNbd1qFP8kZHRmnEwrRp9GiSEI81bDjL6KbZbUmj5qgpXhHJMPdwJFu/hz4LKqsNrb39loSroB5ZH0+qlhjXncVM8gD7dHNgMqbAcDNKWbUVb10SFexqLtVxsxdadxeWkYS95YBfN3PrR/7w9Zt+n1t3X+4f5+btJziuTvOEo7WYsbha9lwjyOg68UlxFg0YziYIGZmn2CtaN1xzbgtYHPE9nW8uacKEilz6at+lEc3KcxnWTNNm/AodMSzJGNm+OCF9h4m7F6ExYdkz7yIOQAKs8CwDwRGqLJu9UmNb9AoOVTJFRyy8Y7U7+R4g3xAM38FTl3DWpn8FegRQ0GiTkjChDkq17eiQoARJG56RrRYjQ2I0vB8ZivmRKTH6z4fXMRgp5kdIxQeSqZgjyUGw9q0hISnmSdbRIS3DKDrIDZa2RzyP23OW0Udy0LKwkYm00wRD3dKG5WqreIe2w+HglCYqUmoHxMEp1VWTUqlVOyQOT0nO0of3pXZMHJ6SnKYPn161g+LwlOREPVnHuQSKT5k1aTSjXEIT0gqJwoSjcJXwXY8jItzuFABDD0dXoiEOfb8YphN/U6CXqvF21X4EpfRWeY5koawOoeDJhJKrhZzy+fncdlGsSzHdljPOfiWTixdJpZSGBeTpE59kXutUr7QVAH2cBzuafxMzwgsS3dM8ZCHtVPBzq8OCMkbjDokZTbs8gV9aWlx5vF0Vy6WjOPcwGfkkzYiHuTOOUprznj/LpUs5RdY0x53BfpfZ4AQ13QLKdzLs9ZH7hjXLi1uc2i1M5dziLAopU7M6Vqn7TVnOopZSAFTtvkpXUypwOod6SgVO51BRqcBJrqkuqfqrqboJu9599pqsQ7m+knS6ZGV9J+sG6rqbe83L4KWKU8Ax2um6Co4hv1FiGzpfxx8AcoqM1C2/+PBu8R8CxLvwoTTz47sjAKc5Lj8dr51Q8XeCWPCKstXnOMqilrBWVyjYvT3sJxbIFQaYWuDqGtgTMDWB4wDHKjeugD091dOAc7bhwig1V/2R4CNi++ZpkgVj3EwWupZizY4b33q/e/Dd/Q/ayraDXwUa0z8=</diagram></mxfile>

‎assets/drawio/454.4-sum-ii.drawio

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
<mxfile modified="2019-05-03T11:25:45.542Z" host="www.draw.io" agent="Mozilla/5.0 (Macintosh; Intel Mac OS X 10_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/73.0.3683.86 Safari/537.36" etag="1h5Ytb8GPu4hJzkI1NZY" version="10.6.6" type="device"><diagram id="hhZ2N8VzGzd5busGkVBM" name="第 1 页">7Vxbc6s2EP41fowHSVzMY3xrH047mclM2zxlOEaxaTGiICd2f30lI4xhFZucYINPyEMGLbp+30raXQkPyGS9/SXx4tVvzKfhABv+dkCmA4xdNBL/pWCXCUwbZYJlEviZ6EjwGPxHldBQ0k3g07SUkTMW8iAuCxcsiuiCl2RekrC3crYXFpZbjb0lBYLHhRdC6Z+Bz1eZdISdQv4rDZarvGVku9mbtZdnViNJV57P3o5EZDYgk4Qxnj2ttxMaSuxyXLJy83feHjqW0IjXKXD3NKMPf/+7cMnv0z+Ws+mz9e35DllZNa9euFEjVr3luxyChG0in8pajAEZv60CTh9jbyHfvgnOhWzF16FIIfH4wiKuWMSGSk9YyJJ9XcSZG8Zc9HCsmqUJp9t3B4QOMAn1omxNebITWfICRCGrVAu7eKiG81ZQhW0lWx3TZKqinlKP5aH2AkHxoED8CKDmzwOoY7SOJgATfQ7NBlDC6KBmCqcRxMkyIEzWpVDCAKVP6lwTKNldQ4kAlO46ABNQJmTpVrGrIgWXsLsOTDugUB1ACu6eXUAK6BR23baRsm9ijeoAUA4AymgfKKBRxDHbBmp0ExrVAaByV+oIqXuAlBgzL8OR8oT9Q3NTM2IRldZnEIYVkRcGy0gkFwIjKuRjiWAgPKh79WId+L5sRot/maH3jNuqEdwAVUe7h6LKhTyZGp7wxXiC1u645wnyhGxHM6WuSxU0uSc9VZAqgnSr33Wpgnb/tKdKQ9XIaZkoaCKe2M9RpyInJi6DaWriUJYucpLvOc2jCe3IdLPusOKfYGo+tw1sN8SUU2bKMVvWemjGLgQ2vGfKGnWLKQzNaOiZdY4lZEKWjP3fZeYTstumqU7M+MvRVJ1MCLkt0wQtaLjd9zTZdtv2M4b28w2ZZZUTwjzGUjrR0qGJL2WXYRhc7+2y/T5Socq2W9Z7GNvvDTO1SHWNKmhD91s+oInk8cXWaHJ7mmrQZI3a3vIJ9HR62wzsUMTFLdMEPR2zp6lKk0lajmsS6On0yx5c9lqfTdDP6WkCNJlEd0HiukTVuLJKI/9eXv4t8Nc7oCfhExAlu78U5vvEk0yI8avkdHv8crrLU9uA74sNsaWST6pp+VyUkom8UKZH+RVjAjRLdGyGptbMOfBKfXBz+SyrNa8gJDT0ePBarl5HpGrhgQXSMToswdW5TSpVpGyTLKgqVagDrKgaXMxNyLwi7iVLykFFgntvd5QtlhnSEx02Kh4NKV2lFg9ZjYXSHjD9hB7rzrvIDaw5WDNpXGdqOE4za44DDvzbDlYSeJgmxnwDNvHVqSJmy7EAAmMBgKb9ckCT2SuVq4IiKv86QyLoe+nqAOc5NkPvOw0fWBrwgGkp/FbJ8J1xztYajjmLdaoguhbLnq+3S/mJzXCdLjw69Gmc0IXHqT+MWSpyPnvZjldSr/1+Np7M8Qf0wg9ExaqvEUskjU3oyuGCQT6rSd3ruxdTFhM6ur2ydFJZiFn3Yu7llKXOwaKoJ4jT99bpI+3w0jj7XO0l2ErtGZfPUMrmYPXY5BQh58zGZk97EdK5AwjSYp6wIj9HC3SvNXfwvxovI62bdlVeen+6xgEvNlqP9pq1Pvf56SdQxWU12p4+0OX4eqTk31IfjkY0d4uuSkoN56Lh0NMQSYSOw0+OadYNQB1Fn1TYqpH40761B5oEAlW59k6LxfF8UEqAtY/+1ND9LLpzdu9vLcxV2XTNwhj6eKCrEoAy3GpVDYW6iFtx2JGhWvrBYJdIFr9hkGUvfgiCzP4H</diagram></mxfile>

‎assets/problems/15.3-sum.png

37.8 KB
Loading

‎assets/problems/454.4-sum-ii.png

47.3 KB
Loading

‎problems/15.3-sum.md

Lines changed: 127 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,127 @@
1+
##题目地址
2+
https://leetcode.com/problems/3sum/description/
3+
4+
##题目描述
5+
```
6+
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
7+
8+
Note:
9+
10+
The solution set must not contain duplicate triplets.
11+
12+
Example:
13+
14+
Given array nums = [-1, 0, 1, 2, -1, -4],
15+
16+
A solution set is:
17+
[
18+
[-1, 0, 1],
19+
[-1, -1, 2]
20+
]
21+
22+
```
23+
##思路
24+
25+
我们采用`分治`的思想. 想要找出三个数相加等于0，我们可以数组依次遍历，
26+
每一项a[i]我们都认为它是最终能够用组成0中的一个数字，那么我们的目标就是找到
27+
剩下的元素（除a[i]）`两个`相加等于-a[i].
28+
29+
通过上面的思路，我们的问题转化为了`给定一个数组，找出其中两个相加等于给定值`，
30+
这个问题是比较简单的， 我们只需要对数组进行排序，然后双指针解决即可。 加上我们需要外层遍历依次数组，因此总的时间复杂度应该是O(N^2)。
31+
32+
思路如图所示：
33+
34+
![15.3-sum](../assets/problems/15.3-sum.png)
35+
36+
>在这里之所以要排序解决是因为， 我们算法的瓶颈在这里不在于排序，而在于O(N^2)，如果我们瓶颈是排序，就可以考虑别的方式了
37+
38+
39+
>如果找某一个特定元素，一个指针就够了。如果是找两个元素满足一定关系（比如求和等于特定值），需要双指针，
40+
当然前提是数组有序。
41+
##关键点解析
42+
43+
- 排序之后，用双指针
44+
- 分治
45+
46+
##代码
47+
```js
48+
49+
/*
50+
* @lc app=leetcode id=15 lang=javascript
51+
*
52+
* [15] 3Sum
53+
*
54+
* https://leetcode.com/problems/3sum/description/
55+
*
56+
* algorithms
57+
* Medium (23.51%)
58+
* Total Accepted: 531.5K
59+
* Total Submissions: 2.2M
60+
* Testcase Example: '[-1,0,1,2,-1,-4]'
61+
*
62+
* Given an array nums of n integers, are there elements a, b, c in nums such
63+
* that a + b + c = 0? Find all unique triplets in the array which gives the
64+
* sum of zero.
65+
*
66+
* Note:
67+
*
68+
* The solution set must not contain duplicate triplets.
69+
*
70+
* Example:
71+
*
72+
*
73+
* Given array nums = [-1, 0, 1, 2, -1, -4],
74+
*
75+
* A solution set is:
76+
* [
77+
* ⁠ [-1, 0, 1],
78+
* ⁠ [-1, -1, 2]
79+
* ]
80+
*
81+
*
82+
*/
83+
/**
84+
*@param{number[]}nums
85+
*@return{number[][]}
86+
*/
87+
varthreeSum=function(nums) {
88+
if (nums.length<3)return [];
89+
constlist= [];
90+
nums.sort((a,b)=> a- b);
91+
for (let i=0; i<nums.length; i++) {
92+
// skip duplicated result without set
93+
if (i>0&& nums[i]=== nums[i-1])continue;
94+
let left= i;
95+
let right=nums.length-1;
96+
97+
// for each index i
98+
// we want to find the triplet [i, left, right] which sum to 0
99+
while (left< right) {
100+
// skip i === left or i === right, in that case, the index i will be used twice
101+
if (left=== i) {
102+
left++;
103+
}elseif (right=== i) {
104+
right--;
105+
}elseif (nums[left]+ nums[right]+ nums[i]===0) {
106+
list.push([nums[left], nums[right], nums[i]]);
107+
// skip duplicated result without set
108+
while(nums[left]=== nums[left+1]) {
109+
left++;
110+
}
111+
left++;
112+
// skip duplicated result without set
113+
while(nums[right]=== nums[right-1]) {
114+
right--;
115+
}
116+
right--;
117+
continue;
118+
}elseif (nums[left]+ nums[right]+ nums[i]>0) {
119+
right--;
120+
}else {
121+
left++;
122+
}
123+
}
124+
}
125+
return list;
126+
};
127+
```

‎problems/2.addTwoNumbers.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,12 +2,13 @@
22
https://leetcode.com/problems/add-two-numbers/description/
33

44
##题目描述
5+
```
56
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
67
78
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
89
910
Example
10-
```
11+
1112
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
1213
Output: 7 -> 0 -> 8
1314
Explanation: 342 + 465 = 807.

‎problems/236.lowest-common-ancestor-of-a-binary-tree.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -148,5 +148,5 @@ var lowestCommonAncestor = function(root, p, q) {
148148
```
149149

150150
##扩展
151-
如果递归的结束条件改为`if (!root || root.left === p || root.right === q) return root;`代表的是嗯呢么意思，对结果有什么样的影响？
151+
如果递归的结束条件改为`if (!root || root.left === p || root.right === q) return root;`代表的是什么意思，对结果有什么样的影响？
152152

‎problems/454.4-sum-ii.md

Lines changed: 116 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,116 @@
1+
2+
3+
##题目地址
4+
https://leetcode.com/problems/4sum-ii/description/
5+
6+
##题目描述
7+
8+
```
9+
Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.
10+
11+
To make problem a bit easier, all A, B, C, D have same length of N where 0 ≤ N ≤ 500. All integers are in the range of -228 to 228 - 1 and the result is guaranteed to be at most 231 - 1.
12+
13+
Example:
14+
15+
Input:
16+
A = [ 1, 2]
17+
B = [-2,-1]
18+
C = [-1, 2]
19+
D = [ 0, 2]
20+
21+
Output:
22+
2
23+
24+
Explanation:
25+
The two tuples are:
26+
1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
27+
2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0
28+
```
29+
##思路
30+
31+
如果按照常规思路去完成查找需要四层遍历，时间复杂是O(n^4), 显然是行不通的。
32+
因此我们有必要想一种更加高效的算法。
33+
34+
我一个思路就是我们将四个数组分成两组，两两结合。
35+
然后我们分别计算`两两结合能够算出的和有哪些，以及其对应的个数`。
36+
37+
如图：
38+
39+
![454.4-sum-ii](../assets/problems/454.4-sum-ii.png)
40+
41+
42+
这个时候我们得到了两个`hashTable`， 我们只需要进行简单的数学运算就可以得到结果。
43+
44+
##关键点解析
45+
46+
47+
48+
##代码
49+
```js
50+
51+
/*
52+
* @lc app=leetcode id=454 lang=javascript
53+
*
54+
* [454] 4Sum II
55+
*
56+
* https://leetcode.com/problems/4sum-ii/description/
57+
*
58+
* algorithms
59+
* Medium (49.93%)
60+
* Total Accepted: 63.2K
61+
* Total Submissions: 125.6K
62+
* Testcase Example: '[1,2]\n[-2,-1]\n[-1,2]\n[0,2]'
63+
*
64+
* Given four lists A, B, C, D of integer values, compute how many tuples (i,
65+
* j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.
66+
*
67+
* To make problem a bit easier, all A, B, C, D have same length of N where 0 ≤
68+
* N ≤ 500. All integers are in the range of -2^28 to 2^28 - 1 and the result
69+
* is guaranteed to be at most 2^31 - 1.
70+
*
71+
* Example:
72+
*
73+
*
74+
* Input:
75+
* A = [ 1, 2]
76+
* B = [-2,-1]
77+
* C = [-1, 2]
78+
* D = [ 0, 2]
79+
*
80+
* Output:
81+
* 2
82+
*
83+
* Explanation:
84+
* The two tuples are:
85+
* 1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
86+
* 2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0
87+
*
88+
*
89+
*
90+
*
91+
*/
92+
/**
93+
*@param{number[]}A
94+
*@param{number[]}B
95+
*@param{number[]}C
96+
*@param{number[]}D
97+
*@return{number}
98+
*/
99+
varfourSumCount=function(A,B,C,D) {
100+
constsumMapper= {};
101+
let res=0;
102+
for (let i=0; i<A.length; i++) {
103+
for (let j=0; j<B.length; j++) {
104+
sumMapper[A[i]+B[j]]= (sumMapper[A[i]+B[j]]||0)+1;
105+
}
106+
}
107+
108+
for (let i=0; i<C.length; i++) {
109+
for (let j=0; j<D.length; j++) {
110+
res+= sumMapper[- (C[i]+D[j])]||0;
111+
}
112+
}
113+
114+
return res;
115+
};
116+
```

‎thinkings/basic-data-structure.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -285,7 +285,7 @@ return, children, sibling也都是一个fiber，因此fiber看起来就是一个
285285

286286
相关概念：
287287

288-
- 真二叉树
288+
- 真二叉树 （所有节点的度数只能是偶数，即只能为0或者2）
289289

290290

291291
另外我也专门开设了[二叉树的遍历](./binary-tree-traversal.md)章节, 具体细节和算法可以去那里查看。

‎thinkings/dynamic-programming.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -155,10 +155,10 @@ f(n) = f(n-1) + f(n-2) 就是【状态转移公式】
155155

156156
###相关问题
157157

158-
[硬币找零问题](../problems/322.coin-change.md)
159-
[硬币找零问题2](../problems/518.coin-change-2.md)
160-
[分词问题](../problems/139.word-break.md)
161-
[416.partition-equal-subset-sum](../problems/416.partition-equal-subset-sum.md)
158+
-[硬币找零问题](../problems/322.coin-change.md)
159+
-[硬币找零问题2](../problems/518.coin-change-2.md)
160+
-[分词问题](../problems/139.word-break.md)
161+
-[416.partition-equal-subset-sum](../problems/416.partition-equal-subset-sum.md)
162162

163163
##总结
164164

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp