代码随想三刷回溯篇2

39. 组合总和

题目

链接

代码

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

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

40. 组合总和 II

题目

链接

代码

class Solution {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        used = new boolean[candidates.length];
        backtracking(candidates,target,0);
        return result;
    }
    List<List<Integer>> result = new ArrayList();
    List<Integer> paths = new ArrayList();
    boolean[] used;
    int sum =0;
    public void backtracking(int[] candidates, int target,int startIndex){
        if(sum>target){
            return;
        }
        if(sum==target){
            result.add(new ArrayList(paths));
            return;
        }

        for(int i = startIndex;i<candidates.length;i++){
            if(i>0&&candidates[i]==candidates[i-1]&&!used[i-1]){
                continue;
            }
            sum += candidates[i];
            used[i] = true;
            paths.add(candidates[i]);
            backtracking(candidates,target,i+1);
            paths.remove(paths.size()-1);
            used[i] = false;
            sum -= candidates[i];
        }

    }
}

131. 分割回文串

题目

链接

代码

class Solution {
    public List<List<String>> partition(String s) {
        backtracking(s,0);
        return result;
    }
    List<List<String>> result = new ArrayList();
    List<String> paths = new ArrayList();
    public void backtracking(String s,int startIndex){
        if(startIndex>=s.length()){
            result.add(new ArrayList(paths));
            return;
        }

        for(int i = startIndex;i<s.length();i++){
            if(!isPa(s,startIndex,i)){
                continue;
            }
            paths.add(s.substring(startIndex,i+1));
            backtracking(s,i+1);
            paths.remove(paths.size()-1);
        }
    }


    private boolean isPa(String s,int start,int end){

        while(start<end){
            if(s.charAt(start)!=s.charAt(end)){
                return false;
            }
            start++;
            end--;
        }

        return true;
    }
}

93. 复原 IP 地址

题目

链接

代码

class Solution {
    public List<String> restoreIpAddresses(String s) {
        backtracking(s,0);
        return result;
    }

    List<String> paths = new ArrayList();
    List<String> result = new ArrayList();
    public void backtracking(String s,int startIndex){
        if(startIndex>=s.length()&&paths.size()==4){
            StringBuilder sb = new StringBuilder();
            for(int i= 0;i<paths.size();i++){
                sb.append(paths.get(i));
                if(i<paths.size()-1){
                    sb.append(".");
                }
            }
            result.add(sb.toString());
        }
        if(startIndex>=s.length()||paths.size()>=4){
            return;
        }

        for(int i = startIndex;i<s.length();i++){
            String sub = s.substring(startIndex,i+1);
            if(!isIp(sub)){
                continue;
            }
            paths.add(sub);
            backtracking(s,i+1);
            paths.remove(paths.size()-1);
        }
    }

    private boolean isIp(String sub){
        if(sub.length()>1&&sub.charAt(0)=='0'){
            return false;
        }
        try{
            int temp = Integer.valueOf(sub);
            if(temp>=0&&temp<=255){
                return true;
            }
        }catch(Exception e){
            return false;
        }
        return false;
    }
}

78. 子集

题目

链接

代码

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        backtracking(nums,0);
        return result;
    }
    List<List<Integer>> result = new ArrayList();
    List<Integer> paths = new ArrayList();
    public void backtracking(int[] nums,int startIndex){
        result.add(new ArrayList(paths));

        for(int i = startIndex;i<nums.length;i++){
            paths.add(nums[i]);
            backtracking(nums,i+1);
            paths.remove(paths.size()-1);
        }

    }
}