LeetCode No.40 Combination Sum II

最新推荐文章于 2024-09-03 18:29:17 发布

huangjw47

最新推荐文章于 2024-09-03 18:29:17 发布

阅读量223

点赞数

分类专栏： leetcode 递归文章标签： leetcode 递归

本文链接：https://blog.csdn.net/woshihuangjianwei/article/details/53118745

版权

leetcode 同时被 2 个专栏收录

114 篇文章 0 订阅

订阅专栏

递归

17 篇文章 0 订阅

订阅专栏

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

===================================================================

题目链接：https://leetcode.com/problems/combination-sum-ii/

题目大意：求出和为target的所有组合。（数组内元素只能用一次）

思路：记录前面pos位的所有组合，每次只能加入pos位及以后的元素，保证所有元素只用一次。

注意点：注意除重。

参考代码：

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort ( candidates.begin() , candidates.end() ) ;
        vector < vector <int> > ans ;
        vector <int> nums ;
        dfs ( candidates , target , ans , nums , 0 ) ;
        return ans ;
    }
    void dfs ( vector <int>& candidates , int target , vector < vector <int> >& ans , vector <int>& nums , int pos )
    {
        if ( target == 0 )
        {
            ans.push_back ( nums ) ;
            return ;
        }
        for ( int i = pos ; i < candidates.size() ; i ++ )
        {
            int dif = target - candidates[i] ;
            if ( dif > 0 )
            {
                if ( i > pos && candidates[i] == candidates[i-1] )
                    continue ;
                nums.push_back ( candidates[i] ) ;
                dfs ( candidates , dif , ans , nums , i + 1 ) ;
                nums.pop_back () ;
            }
            else if ( dif == 0 )
            {
                if ( i > pos && candidates[i] == candidates[i-1] )
                    continue ;
                nums.push_back ( candidates[i] ) ;
                ans.push_back ( nums ) ;
                nums.pop_back () ;
                break ;
            }
            else
                break ;
        }
    }
};