代码随想录算法训练营二十七天 第七章 | 39. 组合总和 40.组合总和II 131.分割回文串

代码随想录算法训练营二十七天 第七章 | 39. 组合总和 40.组合总和II 131.分割回文串

39. 组合总和

class Solution {
    private List<List<Integer>> result = new ArrayList<>();
    private LinkedList<Integer> paths = new LinkedList<>();
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        // 看题想到了组合和排列
        // 组合无序，排列有序
        if (candidates.length == 0) {
            return result;
        }
        test(candidates, target, 0, 0);
        return result;
    }
    public void test(int[] candidates, int target, int sum, int startIndex) {
        // 这个是一种剪枝的方法，也可以提前剪枝
        if (sum > target) {
            return;
        }
        if (sum == target) {
            result.add(new ArrayList<>(paths));
            return;
        }
        // 可以在这里剪枝 
        //for (int i = startIndex; i < candidates.length && sum + candidates[i] <= target; i++){
        for (int i = startIndex; i < candidates.length; i++){
            paths.add(candidates[i]);
            sum += candidates[i];
            // 这个是原因，i，不用加一，表示可以重复读取当前的数
            test(candidates, target, sum, i);
            sum -= candidates[i];
            paths.removeLast();
        }
    }
}

40.组合总和II

class Solution {
    public List<List<Integer>> result = new ArrayList<>();
    public LinkedList<Integer> paths = new LinkedList<>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        test(candidates, target, 0, 0);
        return result;
    }

    public void test(int[] candidates, int target, int sum, int startIndex) {
        if (sum == target) {
            result.add(new ArrayList<>(paths));
            return;
        }
        for (int i = startIndex; i < candidates.length && sum + candidates[i] <= target; i++) {
            // 这里做的去重
            if (i > startIndex && candidates[i] == candidates[i - 1]) {
                continue;
            }

            paths.add(candidates[i]);
            sum += candidates[i];
            test(candidates, target, sum, i + 1);
            sum -= candidates[i];
            paths.removeLast();
        }
    }
}

131.分割回文串

class Solution {
    public List<List<String>> result = new ArrayList<>();
    public LinkedList<String> paths = new LinkedList<>();
    public List<List<String>> partition(String s) {
        test(s, 0);
        return result;
    }

    public void test(String s, int startIndex) {
        if (startIndex >= s.length()) {
            result.add(new ArrayList<>(paths));
            return;
        }
        for (int i = startIndex; i < s.length(); i++) {
            // 我以为往后，其实是往前
            if (ishuiwen(s, startIndex, i)) {
                paths.add(s.substring(startIndex, i+1));
            } else {
                continue;
            }
            test(s, i+1);
            paths.removeLast();
        }
    }

    public boolean ishuiwen(String s, int start, int end) {
        for (int i = start, j = end; i <= j; i++, j--) {
            if (s.charAt(i) != s.charAt(j)) {
                return false;
            }
        }
        return true;
    }

}