216. Combination Sum III LeetCode
2016-02-14 18:52
375 查看
题意:给出n和k,表示你可以使用1-9中的n个数加和组成k,每种组合中1-9的每个数组只能使用一次。要求组合中数字按升序排序。
题解:递归搜索。
题解:递归搜索。
class Solution { public: void dfs(int n,int k,int x,vector<int> v,vector<vector<int>>& ans) { if(n < 0 || k < 0) return; if(n == 0 && k == 0) { ans.push_back(v); return ; } for(int i = x; i <= 9; i++) { v.push_back(i); dfs(n - i,k - 1,i + 1,v,ans); v.pop_back(); } } vector<vector<int>> combinationSum3(int k, int n) { vector<vector<int>> ans; vector<int> v; dfs(n,k,1,v,ans); return ans; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解