93. Restore IP Addresses

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)

代码及总结：

string s;

s.substr(int, int);

s.insert(iterater, int ) //iterator insert(iterator it, char c);

string的成员函数insert有以下多种重载：
string &insert(int p0, const char *s);——在p0位置插入字符串s
string &insert(int p0, const char *s, int n);——在p0位置插入字符串s的前n个字符
string &insert(int p0,const string &s);——在p0位置插入字符串s
string &insert(int p0,const string &s, int pos, int n);——在p0位置插入字符串s从pos开始的连续n个字符
string &insert(int p0, int n, char c);//在p0处插入n个字符c
iterator insert(iterator it, char c);//在it处插入字符c，返回插入后迭代器的位置
void insert(iterator it, const_iterator first, const_iteratorlast);//在it处插入从first开始至last-1的所有字符
void insert(iterator it, int n, char c);//在it处插入n个字符c

或 s.insert(int, string)

AC 代码：

class Solution {
public:
    vector<string> restoreIpAddresses(string s) {
        vector<string> res;
        for(int i = 1; i < 4 && i < s.size() - 1; i++)
            for(int j = i + 1; j < i + 4 && j < s.size() - 1; j++)
                for(int k = j + 1; k < j + 4 && k <= s.size() - 1; k++){
                    if(s.size() - k < 4){
                        string s1 = s.substr( 0, i);
                        string s2 = s.substr(i, j - i);
                        string s3 = s.substr(j, k - j);
                        string s4 = s.substr(k, s.size() - k);
                        int first = stoi(s.substr( 0, i));
                        int second = stoi(s.substr(i, j - i));
                        int third = stoi(s.substr(j, k - j));
                        int forth = stoi(s.substr(k, s.size() - k));
                        // if ( (ans=to_string(A)+"."+to_string(B)+"."+to_string(C)+"."+to_string(D)).length() == s.length()+3)
                        //可以用上行 代替
                        if(s1.size() > 1 && s1[0] == '0') continue;
                        if(s2.size() > 1 && s2[0] == '0') continue;
                        if(s3.size() > 1 && s3[0] == '0') continue;
                        if(s4.size() > 1 && s4[0] == '0') continue;
                        
                        if(0 <= first && first <= 255 && 0 <= second && second <= 255 && 0 <= third && third <= 255 && 0 <= forth && forth <= 255){
                            string temp = s;
                            temp.insert(i, ".");
                            temp.insert(j + 1, ".");
                            temp.insert(k + 2, ".");
                            res.push_back(temp);
                        }
                        
                    } 
                }
        return res;
    }
    
};

递归写法：

class Solution {
public:
    vector<string> restoreIpAddresses(string s) {
        vector<string> result;
        string ip;
        dfs(s,0,0,ip,result); //paras:string s,start index of s,step(from0-3),intermediate ip,final result
        return result;
    }
    void dfs(string s,int start,int step,string ip,vector<string>& result){
        if(start==s.size()&&step==4){
            ip.erase(ip.end()-1); //remove the last '.' from the last decimal number
            result.push_back(ip);
            return;
        }
        if(s.size()-start>(4-step)*3) return;
        if(s.size()-start<(4-step)) return;
        int num=0;
        for(int i=start;i<start+3;i++){
            num=num*10+(s[i]-'0');
            if(num<=255){
                ip+=s[i];
                dfs(s,i+1,step+1,ip+'.',result);
            }
            if(num==0) break;
        }
    }
};