代码随想录算法训练营 Day 28 | 93.复原IP地址,78.子集,90.子集II

93.复原IP地址

讲解链接：代码随想录-93.复原IP地址

主要是单层递归的时候多判断一下子地址是否符合条件。

public List<String> restoreIpAddresses(String s) {
    List<String> results = new ArrayList<>();
    backtracking(s, 0, new ArrayList<>(), results);
    return results;
}

void backtracking(String s, Integer startIndex, List<String> paths, List<String> results) {
    if (paths.size() == 4) {
        if (startIndex == s.length()) {
            StringBuilder temp = new StringBuilder();
            for (int i = 0; i < paths.size(); i++) {
                if (i > 0) {
                    temp.append(".");
                }
                temp.append(paths.get(i));
            }
            results.add(temp.toString());
        }
        return;
    }

    for (int i = startIndex; i < s.length(); i++) {
        if (i - startIndex >= 3) {
            break;
        }
        String sub = s.substring(startIndex, i + 1);
        // 如果开头是0，并且长度大于1，直接break
        // 如果数字大于255，也可以直接break
        if ((sub.startsWith("0") && sub.length() > 1)
                || new Integer(sub).intValue() > 255) {
            break;
        }
        paths.add(sub);
        backtracking(s, i + 1, paths, results);
        paths.remove(paths.size() - 1);
    }
}

78.子集

讲解链接：代码随想录-78.子集

回溯基础吧。

public List<List<Integer>> subsets(int[] nums) {
    List<List<Integer>> results = new ArrayList<>();
    backtracking(nums, 0, new ArrayList<>(), results);
    return results;
}

void backtracking(int[] nums, Integer startIndex, List<Integer> paths, List<List<Integer>> results) {
    results.add(new ArrayList<>(paths));

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

90.子集II

讲解链接：代码随想录-90.子集II

​​

 

public List<List<Integer>> subsetsWithDup(int[] nums) {
    Arrays.sort(nums);
    List<List<Integer>> results = new ArrayList<>();
    backtracing(nums, 0, new ArrayList<>(), results);
    return results;
}

void backtracing(int[] nums, Integer startIndex, List<Integer> paths, List<List<Integer>> results) {
    results.add(new ArrayList<>(paths));
    for (int i = startIndex; i < nums.length; i++) {
        // 跳过当前树层使用过的、相同的元素。
        if (i > startIndex && nums[i - 1] == nums[i]) {
            continue;
        }
        paths.add(nums[i]);
        backtracing(nums, i + 1, paths, results);
        paths.remove(paths.size() - 1);
    }
}