刷题训练day23 | 第七章 回溯算法 part03

题目1：【二刷完成】

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        backtracking(candidates,target,0,0);
        return result;

    }
    public void backtracking(int[] candidates, int target, int sum, int startIndex){
        if (sum>target) return;
        if (sum==target){
            result.add(new ArrayList<>(path));
            return;
        }
        for (int i=startIndex; i<candidates.length;i++){
            path.add(candidates[i]);
            sum += candidates[i];
            backtracking(candidates,target,sum,i);
            sum -= candidates[i];
            path.remove(path.size()-1);
        }
    }
}

题目2：【二刷完成】

class Solution {
    List<Integer> path = new ArrayList<>();
    List<List<Integer>> result = new ArrayList<>();
    boolean[] used;
    //int sum = 0;
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        used = new boolean[candidates.length];
        Arrays.sort(candidates);
         // 加标志数组，用来辅助判断同层节点是否已经遍历
         Arrays.fill(used, false);
         // 为了将重复的数字都放到一起，所以先进行排序
        backtracking(candidates, target, 0,0);
        return result;
    }
    public void backtracking(int[] candidates, int target, int startIndex, int sum ){
       
        if (sum==target){
            result.add(new ArrayList<>(path));
        }
        for (int i=startIndex; i<candidates.length;i++){
            if (sum+candidates[i]>target){
                break;
            }
            // 出现重复节点，同层的第一个节点已经被访问过，所以直接跳过
             if (i > 0 && candidates[i] == candidates[i - 1] && !used[i - 1]) {
                 continue;
            }
            used[i]=true; 
            path.add(candidates[i]);
            sum += candidates[i];
            backtracking(candidates,target,i+1,sum);
            used[i]=false;
            sum -= candidates[i];
            path.remove(path.size()-1);
        }
    }
}

题目3：【二刷完成】

class Solution {
    List<List<String>> lists = new ArrayList<>();
    Deque<String> deque = new LinkedList<>();

    public List<List<String>> partition(String s) {
        backTracking(s, 0);
        return lists;
    }

    private void backTracking(String s, int startIndex) {
        //如果起始位置大于s的大小，说明找到了一组分割方案
        if (startIndex >= s.length()) {
            lists.add(new ArrayList(deque));
            return;
        }
        for (int i = startIndex; i < s.length(); i++) {
            //如果是回文子串，则记录
            if (isPalindrome(s, startIndex, i)) {
                String str = s.substring(startIndex, i + 1);
                deque.addLast(str);
            } else {
                continue;
            }
            //起始位置后移，保证不重复
            backTracking(s, i + 1);
            deque.removeLast();
        }
    }
    //判断是否是回文串
    private boolean isPalindrome(String s, int startIndex, int end) {
        for (int i = startIndex, j = end; i < j; i++, j--) {
            if (s.charAt(i) != s.charAt(j)) {
                return false;
            }
        }
        return true;
    }
}