[LeetCode 93] Restore IP Addresses

原文地址：http://www.tuicool.com/articles/MBBvuu

这里还有一篇：http://blog.csdn.net/doc_sgl/article/details/12351489

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)

我：还是DFS，还有一个substr函数

class Solution {
public:
bool isValid(string num)
{
    if(num.length()==1&&num>="0"&&num<="9") return true;
    if(num.length()==2&&num>="10"&&num<="99") return true;
    if(num.length()==3&&num>="100"&&num<="255") return true;
    return false;
}
void restoreIP(vector<string> &result,vector<string> &ips,int kth,int start,string s)
{
    if(start==s.length())
    {
        if(kth==5)
        {
            string ip=ips[0];
            for(int i=1;i<4;i++)
                ip+="."+ips[i];
            result.push_back(ip);
        }
        return;
    }
    for(int k=1;k<=3&&start+(k-1)<s.length();k++)
    {
        string num=s.substr(start,k);
        if(isValid(num))
        {
            ips.push_back(num);
            restoreIP(result,ips,kth+1,start+k,s);
            ips.pop_back();
        }
    }
}
    vector<string> restoreIpAddresses(string s) {
        vector<string> result;
        if(s.length()<4||s.length()>12)
            return result;
        vector<string> ips;
        restoreIP(result,ips,1,0,s);
        return result;
    }
};