10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T409,class Solution: def combinationSum2( self, candidates: List[int], target: int ) -> List[List[int]]: def backtrack(answer, temp_list, candidates, total_left, index): if total_left < 0: return elif total_left == 0: answer.append(temp_list.copy()) else: for i in range(index, len(candidates)): if i > index and candidates[i] == candidates[i - 1]: continue if total_left < candidates[i]: break temp_list.append(candidates[i]) backtrack( answer, temp_list, candidates, total_left - candidates[i], i + 1, ) temp_list.pop() result = [] candidates.sort() backtrack(result, [], candidates, target, 0) return result13:T423,class Solution { public List> combinationSum2(int[] candidates, int target) { List> answer = new ArrayList<>(); Arrays.sort(candidates); backtrack(answer, new ArrayList<>(), candidates, target, 0); return answer; } private void backtrack(List> answer, List tempList, int[] candidates, int totalLeft, int index) { if (totalLeft < 0) { return; } else if (totalLeft == 0) { answer.add(new ArrayList<>(tempList)); } else { for (int i = index; i < candidates.length; i++) { if (i > index && candidates[i] == candidates[i - 1]) { continue; } if (totalLeft < candidates[i]) { break; } tempList.add(candidates[i]); backtrack(answer, tempList, candidates, totalLeft - candidates[i], i + 1); tempList.remove(tempList.size() - 1); } } } }14:T432,class Solution { public: vector> combinationSum2(vector& candidates, int target) { vector> answer; vector tempList; sort(candidates.begin(), candidates.end()); backtrack(answer, tempList, candidates, target, 0); return answer; } private: void backtrack(vector>& answer, vector& tempList, vector& candidates, int totalLeft, int index) { if (totalLeft < 0) { return; } else if (totalLeft == 0) { answer.push_back(tempList); } else { for (int i = index; i < candidates.size(); i++) { if (i > index && candidates[i] == candidates[i - 1]) { continue; } if (totalLeft < candidates[i]) { break; } tempList.push_back(candidates[i]); backtrack(answer, tempList, candidates, totalLeft - candidates[i], i + 1); tempList.pop_back(); } } } };

Time Complexity

Space Complexity