代码随想录算法训练营第二十七天|LeetCode39、LeetCode40、LeetCode131

最新推荐文章于 2024-07-20 09:51:47 发布

钅黑

最新推荐文章于 2024-07-20 09:51:47 发布

阅读量125

点赞数

文章标签：算法 leetcode 深度优先

本文链接：https://blog.csdn.net/starX5519/article/details/132571992

版权

LeetCode39

题目：

解法：

class Solution {
public:
    vector<vector<int>> result;
    vector<int> ans;
    void backtracing(int target,vector<int>& candidates,int index){
        if(target < 0) return;
        if(target == 0){
            result.push_back(ans);
            return;
        }
        for(int i = index; i < candidates.size();i++){
            ans.push_back(candidates[i]);
            if(target - candidates[i] < 0){
            ans.pop_back();
            continue;
            }
            backtracing(target - candidates[i],candidates,i);
            ans.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        int index = 0;
        backtracing(target,candidates,index);
        return result;
    }
};

LeetCode40

题目：

解法：（注意使用used数组对同一树层进行去重）

class Solution {
public:
    vector<vector<int>> result;
    vector<int> ans;
    void backtracing(vector<int>& candidates, int target,int index,vector<bool> used){
        if(target < 0) return;
        if(target == 0){
            result.push_back(ans);
            return;
        }
        for(int i = index;i < candidates.size();i++){
            if(i > 0 && candidates[i] == candidates[i - 1] && used[i - 1] == false) continue;
            ans.push_back(candidates[i]);
            used[i] = true;
            backtracing(candidates, target - candidates[i], i + 1,used);
            used[i] = false;
            ans.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<bool> used(candidates.size(),false);
        backtracing(candidates, target, 0,used);
        return result;
    }
};

LeetCode131

题目：

解法：（注意判断是否为回文子串之后的处理）

class Solution {
public:
    bool isback(string s){
        for(int i = 0, j = s.size() - 1;i <= j;i++,j--){
            if(s[i] != s[j]) 
            return false;
        }
        return true;
    }
    vector<vector<string>> result;
    vector<string> vec;
    void backtracing(string s,int index){
        if(index == s.size()){
            result.push_back(vec);
            return;
        }
        string ans;
        for(int i = index ;i < s.size();i++){
           ans.push_back(s[i]);
           if(isback(ans)){
               vec.push_back(ans);
           }else{
               continue;
           }
           backtracing(s, i + 1);
           vec.pop_back();              
        }
    }
    vector<vector<string>> partition(string s) {
        backtracing(s,0);
        return result;
    }
};