算法跟学Day28【代码随想录】

第七章 回溯算法

大纲

● 93.复原IP地址
● 78.子集
● 90.子集II

leetcode 93 复原IP地址

class Solution {
    List<String> res = new ArrayList<>();
    StringBuilder sb = new StringBuilder();
    public List<String> restoreIpAddresses(String s) {
        if (s.length() < 4 || s.length() > 12)
            return res;
        backtrack(new StringBuilder(s), 0, 0);
        return res;
    }

    private void backtrack(StringBuilder sb, int pointNum, int index) {
        if (pointNum == 3){
            if (isValid(sb, index, sb.length() - 1)) 
                res.add(sb.toString());
            return;
        }
        for (int i = index; i < sb.length(); i++) {
            if (isValid(sb, index, i)) {
                sb.insert(i + 1, '.');
                backtrack(sb, pointNum + 1, i + 2);
                sb.deleteCharAt(i + 1);
            } else break;
        }
    }

    private boolean isValid(StringBuilder sb, int start, int end) {
        if (start > end) return false;
        if (sb.charAt(start) == '0' && start != end) return false;
        int num = 0;
        for (int i = start; i <= end; i++) {
            num = 10 * num + (sb.charAt(i) - '0');
            if (num > 255) return false;
        }
        return true;
    }
}

leetcode 78 子集

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    List<Integer> item = new ArrayList<>();
    public List<List<Integer>> subsets(int[] nums) {
        backtrack(nums, 0);
        return res;
    }

    private void backtrack(int[] nums, int index) {
        res.add(new ArrayList<>(item));
        for (int i = index; i < nums.length; i++) {
            item.add(nums[i]);
            backtrack(nums, i + 1);
            item.remove(item.size() - 1);
        }
    }
}

leetcode 90 子集II

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    List<Integer> item = new ArrayList<>();
    public List<List<Integer>> subsetsWithDup(int[] nums) {
        Arrays.sort(nums);
        backtrack(nums, 0);
        return res;
    }

    private void backtrack(int[] nums, int index) {
        res.add(new ArrayList<>(item));
        for (int i = index; i < nums.length; i++) {
            if (i > index && nums[i] == nums[i - 1]) continue;
            item.add(nums[i]);
            backtrack(nums, i + 1);
            item.remove(item.size() - 1);
        }
    }
}