Leetcode93(c++).

Leetcode93(c++).

Restore IP Addresses

Given a string s containing only digits, return all possible valid IP addresses that can be obtained from s. You can return them in any order.

A valid IP address consists of exactly four integers, each integer is between 0 and 255, separated by single dots and cannot have leading zeros. For example, “0.1.2.201” and “192.168.1.1” are valid IP addresses and “0.011.255.245”, “192.168.1.312” and “192.168@1.1” are invalid IP addresses.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/restore-ip-addresses
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Example 1:

Input: s = “25525511135”
Output: [“255.255.11.135”,“255.255.111.35”]

Example 2:

Input: s = “0000”
Output: [“0.0.0.0”]

Example 3:

Input: s = “1111”
Output: [“1.1.1.1”]

Example 4:

Input: s = “010010”
Output: [“0.10.0.10”,“0.100.1.0”]

Example 5:

Input: s = “101023”
Output:[“1.0.10.23”,“1.0.102.3”,“10.1.0.23”,“10.10.2.3”,“101.0.2.3”]

Code:

class Solution {
public:
    vector<string> result;
    void backTracking(string s, int startIndex, int pointNum){
        if(pointNum == 3){
            if(isValid(s, startIndex, s.size()-1))
                result.push_back(s);
            return ;
        }
        for(int i=startIndex; i<s.size(); ++i){
            if(isValid(s, startIndex, i)){
                s.insert(s.begin()+i+1,'.');
                pointNum++;
                backTracking(s, i+2, pointNum);
                pointNum--;
                s.erase(s.begin()+i+1);
            }else break ;
        }
    }
    bool isValid(string s, int start, int end){
        if(start > end) return false;
        if(s[start] == '0' && start != end) return false;
        int num = 0;
        for(int i=start; i<=end; ++i){
            if(s[i] > '9' || s[i] < '0')    return false;
            num = num*10 + (s[i] - '0');
            if(num > 255)
                return false;
        }
        return true;
    }
    vector<string> restoreIpAddresses(string s) {
        result.clear();
        backTracking(s, 0, 0);
        return result;
    }  
};