[LeetCode] Restore IP Addresses

最新推荐文章于 2024-09-16 06:54:08 发布

lyangpku

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量364

点赞数

分类专栏：算法递归面试题 LeetCode 文章标签： Leetcode leetcode LeetCode 算法递归面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8550681

版权

算法同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

LeetCode

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    vector<string> ret;
    vector<string> sln;
    
    int stoi(string s) {
        int n = s.size();
        if (n >= 2 && s[0] == '0') return 256;
        
        int ret = 0;
        
        for (int i = 0; i < n; i++) {
            ret = ret * 10 + s[i] - '0'; 
        }
        
        return ret;
    }
    
    void recursion(string s, int pos, int n) {
        if (n == 4 && pos == s.size()) {
            string result = "";
            for (int i = 0; i < 3; i++)
                result += sln[i] + ".";
                
            result += sln[3];
            ret.push_back(result);
        }
        
        if (n == 4 || pos >= s.size()) return;
        
        for (int i = 1; i <= 3; i++) {
            string part = s.substr(pos, i);
            int val = stoi(part);
            if (val > 255) {
                continue;
            } else {
                sln.push_back(part);
                recursion(s, pos + i, n + 1);
                sln.pop_back();
            }
        }
    }
    
    vector<string> restoreIpAddresses(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ret.clear();
        recursion(s, 0, 0);
        return ret;
    }
};

Small Case: 8ms

Large Case: 24ms

Time: O(3^n)

Space: O(n)