[LeetCode]Combination Sum III
来源:互联网 发布:蜂窝移动数据开关无效 编辑:程序博客网 时间:2024/06/05 14:42
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
Ensure that numbers within the set are sorted in ascending order.
Example 1:
Input: k = 3, n = 7
Output:
[[1,2,4]]
DFS+剪枝,注意顺序是递增的。且最大不会大于9.
class Solution {public: vector<vector<int>> combinationSum3(int k, int n) { vector<int> ret; vector<vector<int>> ans; dfs(ans,ret,0,k,n); return ans; } void dfs(vector<vector<int>> &ans,vector<int> &ret,int start,int k,int n){ if(n<((2*start+k+1)*k/2) || n>((19-k)*k/2)) //剪枝加快搜索速度 return; if(k==0){ if(n==0) ans.push_back(ret); return ; } for(int i=start+1; i<=9; ++i){ ret.push_back(i); dfs(ans,ret,i,k-1,n-i); ret.pop_back(); } }};
0 0
- LeetCode Combination Sum III
- [LeetCode] Combination Sum III
- 【leetcode】 Combination Sum III
- [leetcode] Combination Sum III
- [leetCode] Combination Sum III
- leetcode Combination Sum III
- leetcode--Combination Sum III
- LeetCode Combination Sum III
- Leetcode: Combination Sum III
- leetcode: Combination Sum III
- 【leetcode】Combination Sum III
- Combination Sum III -- leetcode
- [Leetcode]Combination Sum III
- Leetcode: Combination Sum III
- leetcode:Combination Sum III
- LeetCode-Combination Sum III
- LeetCode----Combination Sum III
- [Leetcode]Combination Sum III
- 并发API总结
- [Java开发之路](22)hashcode
- Spring学习笔记(二)
- LaTex 数学公式
- JS与WebView交互存在的一些问题
- [LeetCode]Combination Sum III
- EEPROM与FLASH
- xiaoxin juju needs help
- MFC-字体和颜色对话框
- 【LeetCode OJ 075】Sort Colors
- 自动装箱与自动拆箱的注意点
- FZU-2150-Fire Game【BFS】
- [BZOJ4134][JZOJ4401]ljw和lzr的hack比赛
- SQL(三)-- 练习题