zoukankan      html  css  js  c++  java
  • [LeetCode]Combination Sum

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

    The same repeated number may be chosen from C unlimited number of times.

    Note:

    • All numbers (including target) will be positive integers.
    • Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1  a2 ≤ … ≤ ak).
    • The solution set must not contain duplicate combinations.

     

    For example, given candidate set 2,3,6,7 and target 7, 
    A solution set is: 
    [7] 
    [2, 2, 3] 

    class Solution {
    private:
        vector<vector<int> > ret;
    public:
        void DFS(vector<int> &candidates,int dep,vector<int> ans,int sum,int target)
        {
            ans.push_back(candidates[dep]);
            sum+=candidates[dep];
            if(sum==target) 
            {
                ret.push_back(ans);
            }
            else if(sum<target)
            {
                for(int i=dep;i<candidates.size();i++)
                DFS(candidates,i,ans,sum,target);
            }
            else 
            {
                return;
            }
        }
        vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
            ret.clear();
            vector<int> ans;
    		sort(candidates.begin(),candidates.end());
    		for(int i=0;i<candidates.size();i++)
    		DFS(candidates,i,ans,0,target);
    		return ret;
        }
    };
    

      

  • 相关阅读:
    A Bug's Life(削弱版食物链)
    The Suspects
    Find The Multiple
    Lake Counting(dfs)
    经典dfs(depth-first search)
    喝啤酒(预防老年痴呆的深度搜索)
    C语言的位运算的优势 !
    Oil Deposits
    Catch That Cow
    HTML 003 元素
  • 原文地址:https://www.cnblogs.com/Rosanna/p/3471360.html
Copyright © 2011-2022 走看看