Combination Sum II
来源:互联网 发布:襄阳蓝芯软件 编辑:程序博客网 时间:2024/04/28 14:04
此题回朔,注意加入前避免重复
class Solution {public: vector<vector<int>> ret;public: vector<vector<int>> combinationSum2(vector<int>& can, int target) { if(can.size()<1) return ret; sort(can.begin(),can.end()); vector<int> temp; if(target<can[0]) return ret; //temp.push_back(can[0]); bt(can,temp,target,0,target); return ret; } void bt(vector<int>&can,vector<int> ans_vec,int ans,int next_pos,int target){ if(ans<0){ return; } if(target<=0) return ; if(ans==0){ for(int i=0;i<ret.size();i++){ if(ret[i]==ans_vec) return; //最后在这里判断是不是和以前的数组重复了 } ret.push_back(ans_vec); return ; } for(int i=next_pos;i<can.size();i++){ if(ans>=can[i]){ vector<int> temp=ans_vec; temp.push_back(can[i]); bt(can,temp,ans-can[i],i+1,target); } } }};
0 0
- Combination Sum && Combination Sum II
- Combination Sum Combination Sum II
- Combination Sum II
- LeetCode: Combination Sum II
- LeetCode: Combination Sum II
- [LeetCode]Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- Combination Sum II
- [LeetCode] Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- Combination Sum II
- LeetCode: Combination Sum II
- Combination Sum II
- leetcode Combination Sum II
- Combination Sum II
- [LeetCode]Combination Sum II
- B树到B+树再到B*树
- [LeetCode 299] Bulls and Cows
- Android第三方跳转可能会出现事件传入下一个应用中
- Node.js的mysql数据库操作
- 对象池技术apache-common pool的使用
- Combination Sum II
- A计划(bfs)
- rsync sersync2 文件实时双向同步
- Maven学习(二)- 安装m2eclipse插件
- Android基于源码分析Handler的消息机制
- 深入理解Linux修改hostname
- 通过zabora监控oracle
- python eventlet模块
- js中的this指针的用法