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

二.我的解题思路

之前阅读《计算机算法设计与分析》这本书的时候遇到过将正整数划分为一系列正整数和的问题（p14）。当时教材里面说的是用递归法做，设计递归函数有两个变量q(n,m)，划分n,最大加数m。本道leetcode题目跟划分正整数的问题还是比较相似的。本题就是要求在解空间寻找一个合适的解，初步分析也没有什么太好的技巧可以利用。从经典算法思想的角度入手，容易想到采用回溯法解决。本题的解空间模型应当是有所变动的排列树。

题目要求解集是按非降序来排列，所以先使用STL里面的sort函数将candidates进行升序排列。然后，在主函数里面每次选择一个数作为当前候选解集中的最小的数，再调用用于递归的函数。

在递归函数里面，我采用的是vector这种数据类型。采用push_back pop_back这两种方法来记录回溯法走过的路径。测试通过的程序如下：

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<int> curr;
        vector<vector<int>> res;
        int len = candidates.size();

       for(int i=0;i<len;i++){
           int curr_min=candidates[i];
           int curr_target=target-curr_min; 
           curr.push_back(curr_min);
           judge(candidates,i,curr_target,curr,res);
           curr.pop_back();
       }
       return res;
    }

  void judge(vector<int>& candidates, int min_idx,int target,vector<int>&curr,vector<vector<int>>& res ){
     int len = candidates.size();
    if (target == 0)
    {
        //curr.push_back(candidates[min_idx]);
        res.push_back(curr);
    //  curr.pop_back();
    }
    if (target>=candidates[min_idx]){
        for (int i = min_idx; i<len; i++){
            int curr_min = candidates[i];
            int curr_target = target - curr_min;
            curr.push_back(curr_min);
            judge(candidates, i, curr_target, curr, res);
            curr.pop_back();

        }
    }

  }                




};