[LeetCode] 93. Restore IP Addresses

[LeetCode] 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)

---

递归求解，每次递归长度[1,2,3]。

---

class Solution {
public:
    void helper(vector<string>& ans, string& s, int idx, int sublen, string res, int point) {
        if (point > 4) return;
        if (idx >= s.length()) return;
        if (s[idx] == '0' && sublen > 1) return;
        if (atoi(s.substr(idx, sublen).c_str()) > 255) return;

        for (int j=0; j<sublen; ++j)  res.push_back(s[idx+j]);
        if (idx+sublen == s.length() && point == 3) {
            ans.push_back(res);
            return;
        }
        res.push_back('.');
        for (int i=1; i<=3; ++i) {
            helper(ans, s, idx+sublen, i, res, point+1);
        }
        res.pop_back();
        for (int j=0; j<sublen; ++j)  res.pop_back();
    }

    vector<string> restoreIpAddresses(string s) {
        vector<string> ans;
        string res;
        for (int i=1; i<=3; ++i) {
            helper(ans, s, 0, i, res, 0);
        }
        return ans;
    }
};