【leetcode】Combination Sum III

最新推荐文章于 2024-09-02 16:50:54 发布

jimmybao0730

最新推荐文章于 2024-09-02 16:50:54 发布

阅读量390

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/linglun3/article/details/47262025

版权

leetcode 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

Combination Sum III

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]]

Example 2:
Input: k = 3, n = 9
Output:

[[1,2,6], [1,3,5], [2,3,4]]

思路：感觉和leetcode combinations那个题目很相似。只不过，在只有sum=n的时候，才加入到result这个集合中。

class Solution {
public:

    void comb(int n, int level, int k, vector<vector<int> > &result,vector<int> &temp)
    {
        int sum=0;
        for(int i=0;i<temp.size();i++)
        {
            sum+=temp[i];
        }
        if(k!=temp.size() && (n-sum)/(k-temp.size())>9) return;

        if(temp.size()==k && n==sum) //看是否取到了k个数
        {
            result.push_back(temp);
            return;
        }
        else if(temp.size()==k)
            return;

        for(int i=level+1;i<=n-sum;i++)
        {
            temp.push_back(i);
            comb(n, i, k, result, temp);
            temp.pop_back();
        }
    }

    vector<vector<int> > combinationSum3(int k, int n) {
        vector<vector<int> > res;
        if(n == 0 || k ==0 || n/k > 9) return res;
        vector<int> temp;

        for(int i=1;i<n;i++)
        {
            temp.push_back(i);
            comb(n, i, k, res, temp);
            temp.pop_back();
        }

        return res;
    }
};