代码随想录刷题Day23回溯(力扣39，40,131)

Day23 回溯(2)

  39，40,131

---

一、基础知识

• 对int[]进行排序：

• Arrays.sort(candidates);

---

二、题目

debug记录：递归函数backTracking(candidates,target,i);这句刚开始写的是backTracking(candidates,target,startIndex);

导致循环取值，最终用gpt检查后发现。

debug记录：for(int i = startIndex;i<candidates.length&&sum+candidates[i]<=target;i++)中本来写的是<，当然是求解不出结果的

本题比较巧妙的地方在于，在for循环内是跳过了重复的，但是在递归的时候不重复，高啊高啊

本题有一定的难度，主要是拆解他的步骤，另外是stringbuilder不会用导致不熟练

代码

39

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    List<Integer>temp = new ArrayList<>();
    int sum = 0;
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        Arrays.sort(candidates); // 先进行排序
        backTracking(candidates,target,0);
        return res;
    }
    void backTracking(int []candidates,int target,int startIndex){
        if(target==sum){
            res.add(new ArrayList<>(temp));
            return;}
        for(int i = startIndex;i<candidates.length;i++){
            if(sum+candidates[i]>target)continue;
            temp.add(candidates[i]);
            sum+=candidates[i];
            backTracking(candidates,target,i);
            sum-=candidates[i];
            temp.remove(temp.size()-1);
        }
    }
}

40

class Solution {
    List<List<Integer>> combin = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        backTracking(candidates,target,0,0);
        return combin;
    }
    void backTracking(int []candidates,int target,int sum,int startIndex){
        if(sum==target){
            combin.add(new ArrayList<>(path));
            return;
        }
        for(int i = startIndex;i<candidates.length&&sum+candidates[i]<=target;i++){
            if(i>startIndex&&candidates[i]==candidates[i-1]){
                continue;
            }
            path.add(candidates[i]);
            backTracking(candidates,target,sum+candidates[i],i+1);
            path.removeLast();
        }
    }
}

131

import java.util.ArrayList;
import java.util.List;

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    List<List<String>>res = new ArrayList<>();
    List<String> item = new ArrayList<>();
    public List<List<String>> partition(String s) {
        backTracking(s,0,new StringBuilder());
        return res;
    }
    void backTracking(String s,int start,StringBuilder sb){
        if(start == s.length()){
            res.add(new ArrayList<>(item));
            return;
        }
        for (int i = start;i<s.length();i++ ){
            sb.append(s.charAt(i));
            if(isVaild(sb)){
                item.add(sb.toString());
                backTracking(s,i+1,new StringBuilder());
                item.remove(item.size()-1);
            }
        }

    }
    boolean isVaild(StringBuilder sb){
        for(int i = 0;i<sb.length()/2;i++){
            if(sb.charAt(i)!=sb.charAt(sb.length()-i-1))return false;
        }
        return true;
    }
}