day24:回溯part4,切割、子集问题
93.复原 IP 地址
class Solution {
List<String> ans = new ArrayList<>();
public List<String> restoreIpAddresses(String s) {
if (s.length() > 12) return ans;
backtracking(s, 0, 0);
return ans;
}
private void backtracking(String s, int startIndex, int pointNum) {
if (pointNum == 3) {
if(isValid(s, startIndex, s.length() - 1))
ans.add(s);
return;
}
for (int i = startIndex; i < s.length(); i++) {
if (isValid(s, startIndex, i)) {
s = s.substring(0, i + 1) + "." + s.substring(i + 1);
pointNum++;
backtracking(s, i + 2, pointNum);
pointNum--;
s = s.substring(0, i + 1) + s.substring(i + 2);
} else break;
}
}
private boolean isValid(String s, int start, int end) {
if (start > end) return false;
if (s.charAt(start) == '0' && start != end) return false;
int sum = 0;
for (int i = start; i <= end; i++) {
if (s.charAt(i) < '0' || s.charAt(i) > '9')
return false;
sum = sum * 10 + s.charAt(i) - '0';
if (sum > 255) return false;
}
return true;
}
}
78.子集
class Solution {
List<List<Integer>> ans = new ArrayList<>();
List<Integer> path = new LinkedList<>();
public List<List<Integer>> subsets(int[] nums) {
backtracking(nums, 0);
return ans;
}
private void backtracking(int[] nums, int startIndex) {
ans.add(new ArrayList<>(path));
for (int i = startIndex; i < nums.length; i++) {
path.add(nums[i]);
backtracking(nums, i + 1);
path.removeLast();
}
}
}
90.子集 II
和组合II类似的去重思路:树层去重,树枝不用去重
class Solution {
List<List<Integer>> ans = new ArrayList<>();
List<Integer> path = new LinkedList<>();
boolean[] used;
public List<List<Integer>> subsetsWithDup(int[] nums) {
used = new boolean[nums.length];
Arrays.fill(used, false);
Arrays.sort(nums);
backtracking(nums, 0);
return ans;
}
private void backtracking(int[] nums, int startIndex) {
ans.add(new ArrayList<>(path));
for (int i = startIndex; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[i - 1] && !used[i - 1])
continue;
path.add(nums[i]);
used[i] = true;
backtracking(nums, i + 1);
used[i] = false;
path.removeLast();
}
}
}