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)
这道题刚一看,感觉没什么思路,后面看了下提醒,顿时就醒悟了,这就是经典的回溯题。回溯的情况就两种,就是在某个数字时候,是否应该加‘.’号,加是一种情况,不加又是另外一种情况,所以思路一下就有了。有了思路不一定可以正确的解决,这道题要考虑的细节特别多;首先就是,要考虑0开头的分段应该舍弃(前提是这个分段长度大于1),还有一个就是递归结束条件的判断,这里分不满足条件的明显错误的结束,还有就是满足条件的不符合分段要求的结束,最后才是满足条件的结束。搞清楚这几个问题之后,才能正确的解决这个问题;
class Solution {
public:
//递归回溯法
void restoreIp(string s, int curIndex, int dotNum, string curSub, string tmpIp, vector<string> &Res)
{
int len = s.size();
if(atoll(curSub.c_str()) > 255 || dotNum > 3 || curIndex >= len)
{
return;
}
if(dotNum == 3)
{
if(curIndex == s.size() - 1 && curSub.size() > 0)
{
tmpIp += curSub;
Res.push_back(tmpIp);
return;
}
curSub += s.substr(curIndex + 1, s.size() - curIndex - 1);
if(atoll(curSub.c_str()) <= 255 && (curSub.size() == 1 || (curSub.size() > 1 && curSub[0] != '0')))
{
tmpIp += curSub;
Res.push_back(tmpIp);
}
return;
}
if(curIndex + 1 < len)
{
//不断开
if((curSub.size() == 0 && s[curIndex + 1] == '0')
|| (curSub.size() > 0 && curSub[0] == '0'))
{
;
}
else
{
curSub += s[curIndex + 1];
restoreIp(s, curIndex + 1, dotNum, curSub, tmpIp, Res);
curSub.pop_back(); //回溯
}
//断开
tmpIp += curSub + '.';
string tmpSub = "";
tmpSub += s[curIndex + 1];
restoreIp(s, curIndex + 1, dotNum + 1, tmpSub , tmpIp, Res);
}
}
vector<string> restoreIpAddresses(string s) {
int len = s.size();
vector<string> Res;
if(len < 4)
{
return Res;
}
string curSub = "";
curSub += s[0];
string tmpIp = "";
restoreIp(s, 0, 0, curSub, tmpIp, Res);
return Res;
}
};