class Solution {
public:
void DFS(string s,int start,int step,string tmp,vector<string>&ret)
{//tmp相当于容器
if(start==s.size()&&step==4)
{
tmp.resize(tmp.size()-1);
ret.push_back(tmp);
}
if(s.size()-start<(4-step))
return;
if(s.size()-start>(4-step)*3)
return;
int num=0;
for(int i=start;i<start+3;i++)
{
num=num*10+(s[i]-'0');//当前节点合法,继续递归
if(num<=255)
{
tmp+=s[i];
DFS(s,i+1,step+1,tmp+'.',ret);
}
}
}
vector<string> restoreIpAddresses(string s) {
vector<string> ret;
string tmp;
DFS(s,0,0,tmp,ret);
return ret;
}
};
public:
void DFS(string s,int start,int step,string tmp,vector<string>&ret)
{//tmp相当于容器
if(start==s.size()&&step==4)
{
tmp.resize(tmp.size()-1);
ret.push_back(tmp);
}
if(s.size()-start<(4-step))
return;
if(s.size()-start>(4-step)*3)
return;
int num=0;
for(int i=start;i<start+3;i++)
{
num=num*10+(s[i]-'0');//当前节点合法,继续递归
if(num<=255)
{
tmp+=s[i];
DFS(s,i+1,step+1,tmp+'.',ret);
}
}
}
vector<string> restoreIpAddresses(string s) {
vector<string> ret;
string tmp;
DFS(s,0,0,tmp,ret);
return ret;
}
};