题目:
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)
解法:
class Solution {
List<String> ret ;
public List<String> restoreIpAddresses(String s) {
/*
排列组合限定范围 1-255
*/
ret = new ArrayList<>();
dfs(0,"",s);
return ret;
}
public void dfs(int cnt, String p, String s){
if(cnt == 4 || s.length() ==0) { //第一个循环是跳出条件,cnt==4用来筛选剔除掉数比较大
if(cnt==4 && s.length()==0){ //第二个循环=》满足4次且字符串也已经切割完
ret.add(p);
}
return;
}
for(int i=0; i<s.length()&&i<=2; i++){
if(i!=0 && s.charAt(0) == '0') break;
String x = s.substring(0,i+1);
int x1 = Integer.valueOf(x);
if(x1 <256) dfs(cnt+1,p.length()!=0?p+"."+x:x, s.substring(i+1));
}
}
}
思路:4位最多表示255,那么每次只能取字符串的3位。