Combination Sum

[leetcode]Combination Sum

链接：https://leetcode.com/problems/combination-sum/description/

Question

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

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

Note:

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

Example 1

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]

Solution

class Solution {
public:
  vector<vector<int>> res;
  vector<int> candidates;
  int size;
  set<string> myset;

  string getStr(vector<int> ans) {
    string str;
    for (int i = 0; i < ans.size(); i++)
      str += to_string(ans[i])+"+";
    return str;
  }

  void dfs(int leftSum, vector<int> ans) {
    if (leftSum == 0) {
      sort(ans.begin(), ans.end());
      string str = getStr(ans);
      if (myset.count(str) == 0) {
        res.push_back(ans);
        myset.insert(str);
      }
      return;
    }
    for (int i = 0; i < candidates.size(); i++) {
      if (leftSum >= candidates[i]) {
        ans.push_back(candidates[i]);
        dfs(leftSum - candidates[i], ans);
        ans.pop_back();
      } else {
        break;
      }
    }
    return;
  }

  vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
    res.clear();
    this->candidates = candidates;
    sort(this->candidates.begin(), this->candidates.end());
    this->size = candidates.size();
    dfs(target, vector<int>());
    return res;
  }
};

思路：组合数中的常规递归回溯题目。基本思想是遍历选择数组candidates中所有可能的值，如果数组的值是唯一选择的，则需要用一个visited数组标记是否已选。