Given a string containing only digits, restore it by returning all possible valid IP address combinations.
For example:
Given "25525511135",
return ["255.255.11.135", "255.255.111.35"]. (Order does not matter)
典型DFS题
public class Solution {
public List<String> restoreIpAddresses(String s) {
List<String> res = new ArrayList<String>();
if (s == null || s.length() < 4) {
return res;
}
for (int i = 0; i < 3; i ++) {
if (isVaild(s.substring(0, i + 1))) {
helper(res, s.substring(0, i + 1), i + 1, 1, s);
}
}
return res;
}
private void helper(List<String> res, String nowStr, int nowIndex, int cnt, String s) {
if (cnt == 4) {
if (nowIndex == s.length()) {
res.add(nowStr);
} else {
return;
}
}
for (int i = 0; i < 3; i++) {
if (nowIndex + i >= s.length()) {
break;
}
String nowSubStr = s.substring(nowIndex, nowIndex + i + 1);
if (isVaild(nowSubStr)) {
helper(res, nowStr + "." + nowSubStr, nowIndex + i + 1, cnt + 1, s);
}
}
}
private boolean isVaild(String s) {
if (s == null || s.length() < 1 || s.length() > 3) {
return false;
}
if (s.charAt(0) == '0' && s.length() > 1) {
return false;
}
int num = Integer.parseInt(s);
if (num < 0 || num > 255) {
return false;
}
return true;
}
}