[LeetCode] Combination Sum

最新推荐文章于 2024-10-14 18:52:56 发布

lyangpku

最新推荐文章于 2024-10-14 18:52:56 发布

阅读量339

点赞数

分类专栏： LeetCode 面试题算法 DFS 文章标签： DFS dfs Leetcode leetcode LeetCode 算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8547537

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    vector<vector<int> > ret;
    vector<int> sln;
    
    void DFS(vector<int> &nums, int target, int n) {
        if (target == 0) {
            ret.push_back(sln);
            return;
        }
        
        if (target < 0 || n == nums.size()) return;
        
        int num = nums[n];
        
        for (int i = 0; i * num <= target; i++) {
            for (int j = 0; j < i; j++)
                sln.push_back(num);
                
            DFS(nums, target - i * num, n + 1);
            
            for (int j = 0; j < i; j++)
                sln.pop_back();
        }
    }
    
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ret.clear();
        sort(candidates.begin(), candidates.end());
        
        DFS(candidates, target, 0);
        
        return ret;
    }
};

Small Case: 12ms

Large Case: 80ms