1.2 KiB
1.2 KiB
TODO 0040. Combination Sum II medium
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.
Each number in candidates may only be used once in the combination.
Note: The solution set must not contain duplicate combinations.
Example 1:
Input: candidates = [10,1,2,7,6,1,5], target = 8
Output:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]Example 2:
Input: candidates = [2,5,2,1,2], target = 5
Output:
[
[1,2,2],
[5]
]Constraints:
1 <= candidates.length <= 1001 <= candidates[i] <= 501 <= target <= 30
TODO Approach
Write your approach here.
TODO Python
class Solution:
def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]:TODO C++
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
}
};