leetcode 491. Increasing Subsequences

1.概述

改题是一道backtracking question，和Combination Sum及Combination Sum II相似，又有些许的不同,本文先对比这三道题的相同点和不同点，再归纳同类的backtracking questions

2.Combination Sum及Combination Sum II

Combination Sum，简单的backtracking

class Solution {
public:
    std::vector<std::vector<int> > combinationSum(std::vector<int> &candidates, int target) {
        std::vector<std::vector<int> > res;
        std::vector<int> combination;
        combinationSum(candidates, target, res, combination, 0);
        return res;
    }
private:
    void combinationSum(std::vector<int> &candidates, int target, std::vector<std::vector<int> > &res, std::vector<int> &combination, int begin) {
        if (!target) {
            res.push_back(combination);
            return;
        }
        for (int i = begin; i != candidates.size(); ++i) 
        {
            if(target >= candidates[i])
            {
                combination.push_back(candidates[i]);
                combinationSum(candidates, target - candidates[i], res, combination, i);
                combination.pop_back();
            }
        }
    }
};

Combination Sum II，和Combination Sum的主要不同之处在于下述代码，由于重复元素的出现，需要跳过重复的元素，由于事先对数组进行了排序，所以每次dfs加入的元素都是不一样的。

            if(i>start&&candidates[i]==candidates[i-1])
                continue;

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

3.Increasing Subsequences

使用和Combination Sum II同样的思路（%80通过）

class Solution {
public:
    void dfs(vector<vector<int>>& res,vector<int> temp,int index,vector<int>& nums)
    {
        if(index>=nums.size())
            return;
        for(int i=index;i<nums.size();i++)
        {
            if(i!=index&&nums[i]==nums[i-1])///和Combination Sum II一样的思路
                continue;
            if(temp.empty()||nums[i]>=temp.back())
            {
                temp.push_back(nums[i]);
                if(temp.size()>=2)
                    res.push_back(temp);
                dfs(res,temp,i+1,nums);
                temp.pop_back();
            }
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        int len = nums.size();
        vector<vector<int>> res;
        if(len==0)
            return res;
        vector<int> temp;
        //temp.push_back(nums[0]);
        dfs(res,temp,0,nums);
        return res;
    }
};

最开始按照Combination Sum II的思路，只能过百分之80，类似样例[1,2,3,4,5,6,7,8,9,10,1,1,1,1,1]无法通过，这是由于Combination Sum II事先进行了排序，所以每次dfs加入的元素可以保证不一样，但是Increasing Subsequences无法事先进行排序，所以类似[1,2,3,4,5,6,7,8,9,10,1,1,1,1,1]这样的样例在第一次dfs的时候会加入两个1，导致重复的元素，通过将下述方法改成使用set判断重复元素，可以保证每次dfs加入的都是不同的元素，可通过所有样例。

            if(i!=index&&nums[i]==nums[i-1])///和Combination Sum II一样的思路
                continue;

使用set判重（%100通过）：

class Solution {
public:
    void dfs(vector<vector<int>>& res,vector<int> temp,int index,vector<int>& nums)
    {
        if(index>=nums.size())
            return;
        set<int> all;
        for(int i=index;i<nums.size();i++)
        {
            if(all.find(nums[i])!=all.end())
                continue;
            all.insert(nums[i]);
            //if(i!=index&&nums[i]==nums[i-1])
            //    continue;
            if(temp.empty()||nums[i]>=temp.back())
            {
                temp.push_back(nums[i]);
                if(temp.size()>=2)
                    res.push_back(temp);
                dfs(res,temp,i+1,nums);
                temp.pop_back();
            }
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        int len = nums.size();
        vector<vector<int>> res;
        if(len==0)
            return res;
        vector<int> temp;
        //temp.push_back(nums[0]);
        dfs(res,temp,0,nums);
        return res;
    }
};

4.同类的backtracking questions归纳