【Leetcode】之 Combination Sum II
来源:互联网 发布:java如何创建线程池 编辑:程序博客网 时间:2024/05/21 21:33
一.问题描述
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
二.我的解题思路
这道题是上一道题的变种,程序变动的地方也很少。测试通过的程序如下:
class Solution {public: vector<vector<int>> combinationSum2(vector<int>& candidates, int target) { sort(candidates.begin(), candidates.end()); vector<int> curr; vector<vector<int>> res; int len = candidates.size(); for(int i=0;i<len;i++){ if(i>0&&candidates[i]==candidates[i-1]) continue; //防止找到重复的解 int curr_min=candidates[i]; int curr_target=target-curr_min; curr.push_back(curr_min); judge(candidates,i,curr_target,curr,res); curr.pop_back(); } return res; } void judge(vector<int>& candidates, int min_idx,int target,vector<int>&curr,vector<vector<int>>& res ){ int len = candidates.size(); if (target == 0) { //curr.push_back(candidates[min_idx]); res.push_back(curr); // curr.pop_back(); } if (target>=candidates[min_idx]){ for (int i = min_idx+1; i<len; i++){ if(i>min_idx+1&&candidates[i]==candidates[i-1]) //防止找到重复的解 continue; int curr_min = candidates[i]; int curr_target = target - curr_min; curr.push_back(curr_min); judge(candidates, i, curr_target, curr, res); curr.pop_back(); } } } };
本题的易错点在于解集不得包含重复的解。而按照上一题的解法,会包含重复解,所以需要在程序中加上标注的两处判断语句。
0 0
- leetcode之Combination Sum && Combination Sum II
- 【Leetcode】之 Combination Sum II
- leetcode之Combination Sum II
- Leetcode之combination-sum-ii
- LeetCode题目之8 Combination Sum II
- leetcode之Combination Sum II 问题
- LeetCode: Combination Sum II
- LeetCode: Combination Sum II
- [LeetCode]Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- [LeetCode] Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- LeetCode: Combination Sum II
- leetcode Combination Sum II
- [LeetCode]Combination Sum II
- [leetcode] Combination Sum II
- mysql分区表
- schema_reference.4: Failed to read schema document 'http://www.springframework.org/schema/beans/spri
- apache httpd安装及配置
- <LeetCode OJ> 69 / 367 Sqrt(x) / Valid Perfect Square
- Java Swing JTable 表格【16:复选框JCheckBox作为表格元素】
- 【Leetcode】之 Combination Sum II
- MySQL High Availability总结(三) 配置Slave
- Python函数
- mysql主从复制架构
- iOS合理利用Local Push和Long-running background task
- 人脸识别 交叉验证函数crossvalind 的用法
- Android 源码编译过程
- Spring+Mybatis+Struts2框架搭建
- 从无到有:微信后台系统的演进之路