【LeetCode】040. Combination Sum II

题目:

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

Note:

  • All numbers (including target) will be positive integers.
  • The solution set must not contain duplicate combinations.

 

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8
A solution set is: 

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

 

题解:

Solution 1 (TLE)

复制代码
class Solution {
public:
    void dfs(vector<vector<int>>& vv, vector<int>& v, vector<int> candidates, int target, int sum, vector<int>& visited) {
        if(sum == target) {
            vector<int>* tmp = new vector<int>;
            *tmp = v;
            sort((*tmp).begin(), (*tmp).end());
            if(find(vv.begin(), vv.end(), *tmp) == vv.end())
                vv.push_back(*tmp);
            delete tmp;
            return;
        }
        if(sum > target) return;
        for(int i=0; i<candidates.size(); ++i) {
            if(visited[i] != 0) continue;
            v.push_back(candidates[i]);
            visited[i] = 1;
            dfs(vv, v, candidates, target, sum+candidates[i], visited);
            v.pop_back();
            visited[i] = 0;
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> vv;
        vector<int> v;
        vector<int> visited(candidates.size(),0);
        dfs(vv, v, candidates, target, 0, visited);
        return vv;        
    }
};
复制代码

  Solution 1 中即使i从level开始遍历,也无法accepted,加入stop后才勉强通过,即Solution 2 

Solution 2 (almost TLE but not 579ms)

复制代码
class Solution {
public:
    void dfs(vector<vector<int>>& vv, vector<int>& v, vector<int> candidates, int target, int sum, vector<int>& visited, int stop,int level) {
        if(sum == target) {
            vector<int>* tmp = new vector<int>;
            *tmp = v;
            sort((*tmp).begin(), (*tmp).end());
            if(find(vv.begin(), vv.end(), *tmp) == vv.end())
                vv.push_back(*tmp);
            delete tmp;
            return;
        }
        if(sum > target) {stop = 1;return;}
        for(int i=level; i<candidates.size(); ++i) {
            if(visited[i] != 0) continue;
            v.push_back(candidates[i]);
            visited[i] = 1;
            dfs(vv, v, candidates, target, sum+candidates[i], visited, stop, level+1);
            if(stop == 1) {stop = 0;break;}
            v.pop_back();
            visited[i] = 0;
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> vv;
        vector<int> v;
        vector<int> visited(candidates.size(),0);
        sort(candidates.begin(), candidates.end());
        dfs(vv, v, candidates, target, 0, visited, 0, 0);
        return vv;        
    }
};
复制代码

 

Solution 3 ()

复制代码
class Solution {
public:
    void dfs(vector<vector<int>>& vv, vector<int>& v, vector<int> candidates, int target, vector<int>& visited, int stop,int level) {
        if(target == 0) {
            vector<int>* tmp = new vector<int>;
            *tmp = v;
            sort((*tmp).begin(), (*tmp).end());
            if(find(vv.begin(), vv.end(), *tmp) == vv.end())
                vv.push_back(*tmp);
            delete tmp;
            return;
        }
        if(target<0) {stop = 1;return;}
        for(int i=level; i<candidates.size(); ++i) {
            if(visited[i] != 0) continue;
            v.push_back(candidates[i]);
            visited[i] = 1;
            dfs(vv, v, candidates, target-candidates[i], visited, stop,level+1);
            if(stop == 1) {stop = 0;break;}
            v.pop_back();
            visited[i] = 0;
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> vv;
        vector<int> v;
        vector<int> visited(candidates.size(),0);
        sort(candidates.begin(), candidates.end());
        dfs(vv, v, candidates, target, visited, 0,0);
        return vv;        
    }
};
复制代码

Solution 4 

 

posted @   Vincent丶丶  阅读(180)  评论(0编辑  收藏  举报
编辑推荐:
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
阅读排行:
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 数据库服务器 SQL Server 版本升级公告
· C#/.NET/.NET Core技术前沿周刊 | 第 23 期(2025年1.20-1.26)
· 程序员常用高效实用工具推荐,办公效率提升利器!
点击右上角即可分享
微信分享提示