给定一个只包含数字的字符串,复原它并返回所有可能的 IP 地址格式。
示例:
输入: "25525511135"
输出: ["255.255.11.135", "255.255.111.35"]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/restore-ip-addresses
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
暴力解法
class Solution {
public List<String> restoreIpAddresses(String s) {
List<String> res = new ArrayList<>();
int n = s.length();
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < i + 4; j++) {
for (int k = j + 1; k < j + 4; k++) {
if (i < n && j < n && k < n) {
String tmp1 = s.substring(0, i + 1);
String tmp2 = s.substring(i + 1, j + 1);
String tmp3 = s.substring(j + 1, k + 1);
String tmp4 = s.substring(k + 1);
if (helper(tmp1) && helper(tmp2) && helper(tmp3) && helper(tmp4))
res.add(tmp1 + "." + tmp2 + "." + tmp3 + "." + tmp4);
}
}
}
}
return res;
}
private boolean helper(String tmp) {
if (tmp == null || tmp.length() == 0 || tmp.length() > 3 || (tmp.charAt(0) == '0' && tmp.length() > 1) || Integer.parseInt(tmp) > 255)
return false;
return true;
}
}
回溯
class Solution {
public List<String> restoreIpAddresses(String s) {
List<String> res = new ArrayList<>();
int n = s.length();
backtrack(0, "", 4, s, res, n);
return res;
}
private void backtrack(int i, String tmp, int flag, String s, List<String> res, int n) {
if (i == n && flag == 0) {
res.add(tmp.substring(0, tmp.length() - 1));
return;
}
if (flag < 0) return;
for (int j = i; j < i + 3; j++) {
if (j < n) {
if (i == j && s.charAt(j) == '0') {
backtrack(j + 1, tmp + s.charAt(j) + ".", flag - 1, s, res, n);
break;
}
if (Integer.parseInt(s.substring(i, j + 1)) <= 255)
backtrack(j + 1, tmp + s.substring(i, j + 1) + ".", flag - 1, s, res, n);
}
}
}
}