class Solution {
public:
vector<string> restoreIpAddresses(string s) {
vector<string> res;
string cur;
dfs(res,cur,s,0);
return res;
}
void dfs(vector<string> &res,string cur,string s,int cnt){
if(cnt==3 && judge(s)){ //剩下的都需要放在最后部分
res.push_back(cur+s);
return;
}
for(int i=1;i<4 && i<s.size();i++){
string sub = s.substr(0,i); //从头开始,长度为i,即0到i-1
if(judge(sub))
dfs(res,cur+sub+".",s.substr(i),cnt+1);
}
}
bool judge(string s){
stringstream ss;
ss<<s;
int num;
ss>>num;
if(s.size()>1)
return s[0]!='0' && num>=0 && num<=255;
else
return num>=0 && num<=255;
}
};
leetcode 生成所有的满足条件的ip
猜你喜欢
转载自blog.csdn.net/weixin_42246923/article/details/80980807
今日推荐
周排行