zoukankan      html  css  js  c++  java
  • [LeetCode]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.
    • 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 10,1,2,7,6,1,5 and target 8, 
    A solution set is: 
    [1, 7] 
    [1, 2, 5] 
    [2, 6] 
    [1, 1, 6] 

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

      

  • 相关阅读:
    软件工程
    ROR
    全息技术(Holographic technique)
    VR技术、AR技术、MR技术
    人工智能(AI)
    机器学习(Machine Learning)
    hdoj Scaena Felix
    周赛题解
    Good Luck in CET-4 Everybody!(博弈)
    Paths on a Grid(规律)
  • 原文地址:https://www.cnblogs.com/Rosanna/p/3471621.html
Copyright © 2011-2022 走看看