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

Commita951ec6

Browse files
author
luzhipeng
committed
fix: typo
1 parent2f9b3bb commita951ec6

File tree

5 files changed

+56
-95
lines changed

5 files changed

+56
-95
lines changed

‎problems/40.combination-sum-ii.md

Lines changed: 11 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,33 @@
11
##题目地址
2-
https://leetcode.com/problems/combination-sum/description/
2+
https://leetcode.com/problems/combination-sum-ii/description/
33

44
##题目描述
55
```
6-
Given aset of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
6+
Given acollection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
77
8-
The same repeated number may bechosen from candidates unlimited number of times.
8+
Each number in candidates mayonlybeused once in the combination.
99
1010
Note:
1111
1212
All numbers (including target) will be positive integers.
1313
The solution set must not contain duplicate combinations.
1414
Example 1:
1515
16-
Input: candidates = [2,3,6,7], target =7,
16+
Input: candidates = [10,1,2,7,6,1,5], target =8,
1717
A solution set is:
1818
[
19-
[7],
20-
[2,2,3]
19+
[1, 7],
20+
[1, 2, 5],
21+
[2, 6],
22+
[1, 1, 6]
2123
]
2224
Example 2:
2325
24-
Input: candidates = [2,3,5], target =8,
26+
Input: candidates = [2,5,2,1,2], target =5,
2527
A solution set is:
2628
[
27-
[2,2,2,2],
28-
[2,3,3],
29-
[3,5]
29+
[1,2,2],
30+
[5]
3031
]
3132
3233
```

‎problems/46.permutations.md

Lines changed: 11 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,21 @@
11
##题目地址
2-
https://leetcode.com/problems/combination-sum/description/
2+
https://leetcode.com/problems/permutations/description/
33

44
##题目描述
55
```
6-
Given aset ofcandidate numbers (candidates) (without duplicates) and a target number (target), find allunique combinations in candidates where the candidate numbers sums to target.
6+
Given acollection ofdistinct integers, return allpossible permutations.
77
8-
The same repeated number may be chosen from candidates unlimited number of times.
8+
Example:
99
10-
Note:
11-
12-
All numbers (including target) will be positive integers.
13-
The solution set must not contain duplicate combinations.
14-
Example 1:
15-
16-
Input: candidates = [2,3,6,7], target = 7,
17-
A solution set is:
18-
[
19-
[7],
20-
[2,2,3]
21-
]
22-
Example 2:
23-
24-
Input: candidates = [2,3,5], target = 8,
25-
A solution set is:
10+
Input: [1,2,3]
11+
Output:
2612
[
27-
[2,2,2,2],
28-
[2,3,3],
29-
[3,5]
13+
[1,2,3],
14+
[1,3,2],
15+
[2,1,3],
16+
[2,3,1],
17+
[3,1,2],
18+
[3,2,1]
3019
]
3120
3221
```

‎problems/47.permutations-ii.md

Lines changed: 8 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,18 @@
11
##题目地址
2-
https://leetcode.com/problems/combination-sum/description/
2+
https://leetcode.com/problems/permutations-ii/description/
33

44
##题目描述
55
```
6-
Given aset ofcandidatenumbers(candidates) (without duplicates) and a target number (target), find all uniquecombinations in candidates where the candidate numbers sums to target.
6+
Given acollection of numbersthat might contain duplicates, return allpossibleuniquepermutations.
77
8-
The same repeated number may be chosen from candidates unlimited number of times.
8+
Example:
99
10-
Note:
11-
12-
All numbers (including target) will be positive integers.
13-
The solution set must not contain duplicate combinations.
14-
Example 1:
15-
16-
Input: candidates = [2,3,6,7], target = 7,
17-
A solution set is:
18-
[
19-
[7],
20-
[2,2,3]
21-
]
22-
Example 2:
23-
24-
Input: candidates = [2,3,5], target = 8,
25-
A solution set is:
10+
Input: [1,1,2]
11+
Output:
2612
[
27-
[2,2,2,2],
28-
[2,3,3],
29-
[3,5]
13+
[1,1,2],
14+
[1,2,1],
15+
[2,1,1]
3016
]
3117
3218
```

‎problems/78.subsets.md

Lines changed: 14 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -1,34 +1,28 @@
11

22
##题目地址
3-
https://leetcode.com/problems/combination-sum/description/
3+
https://leetcode.com/problems/subsets/description/
44

55
##题目描述
66
```
7-
Given a set ofcandidate numbers (candidates) (without duplicates) and a target number (target), find allunique combinations in candidates wherethecandidate numbers sums to target.
7+
Given a set ofdistinct integers, nums, return allpossible subsets (thepower set).
88
9-
Thesame repeated number may be chosen from candidates unlimited number of times.
9+
Note:Thesolution set must not contain duplicate subsets.
1010
11-
Note:
11+
Example:
1212
13-
All numbers (including target) will be positive integers.
14-
The solution set must not contain duplicate combinations.
15-
Example 1:
16-
17-
Input: candidates = [2,3,6,7], target = 7,
18-
A solution set is:
13+
Input: nums = [1,2,3]
14+
Output:
1915
[
20-
[7],
21-
[2,2,3]
16+
[3],
17+
[1],
18+
[2],
19+
[1,2,3],
20+
[1,3],
21+
[2,3],
22+
[1,2],
23+
[]
2224
]
23-
Example 2:
2425
25-
Input: candidates = [2,3,5], target = 8,
26-
A solution set is:
27-
[
28-
[2,2,2,2],
29-
[2,3,3],
30-
[3,5]
31-
]
3226
3327
```
3428

‎problems/90.subsets-ii.md

Lines changed: 12 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -1,33 +1,24 @@
11

22
##题目地址
3-
https://leetcode.com/problems/combination-sum/description/
3+
https://leetcode.com/problems/subsets-ii/description/
44

55
##题目描述
66
```
7-
Given aset ofcandidate numbers (candidates) (without duplicates) and a target number (target), find allunique combinations in candidates wherethecandidate numbers sums to target.
7+
Given acollection ofintegers that might contain duplicates, nums, return allpossible subsets (thepower set).
88
9-
Thesame repeated number may be chosen from candidates unlimited number of times.
9+
Note:Thesolution set must not contain duplicate subsets.
1010
11-
Note:
11+
Example:
1212
13-
All numbers (including target) will be positive integers.
14-
The solution set must not contain duplicate combinations.
15-
Example 1:
16-
17-
Input: candidates = [2,3,6,7], target = 7,
18-
A solution set is:
19-
[
20-
[7],
21-
[2,2,3]
22-
]
23-
Example 2:
24-
25-
Input: candidates = [2,3,5], target = 8,
26-
A solution set is:
13+
Input: [1,2,2]
14+
Output:
2715
[
28-
[2,2,2,2],
29-
[2,3,3],
30-
[3,5]
16+
[2],
17+
[1],
18+
[1,2,2],
19+
[2,2],
20+
[1,2],
21+
[]
3122
]
3223
3324
```

0 commit comments

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