Restore IP Addresses

最新推荐文章于 2021-09-03 20:35:52 发布

smallfish_yy

最新推荐文章于 2021-09-03 20:35:52 发布

阅读量405

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode DFS

本文链接：https://blog.youkuaiyun.com/smallfish_yy/article/details/19006693

LeetCode 同时被 2 个专栏收录

101 篇文章

订阅专栏

DFS

8 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)策略来恢复由纯数字字符串组成的可能的有效IP地址组合的方法。通过合理的优化减少不必要的计算步骤，确保了算法效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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)

Analysis: DFS. We can optimize a little bit during the recursion to avoid compute some unnecessary cases. Note something like "10.020.255.255" is meaningless.

public class Solution {
    public void restoreIpAddress(String s, ArrayList<String> res, StringBuilder tem, int len, int level) {
        if(level == 4) {
            if(len==s.length()) res.add(tem.toString());
            return;
        }

        for(int i=len+1; i<=len+3; i++) {
            if(i<=s.length() && s.length()-i>=3-level && s.length()-i<=(3-level)*3) {   // optimaization
                String current = s.substring(len, i);
                if(Integer.valueOf(current)>=0 && Integer.valueOf(current)<=255) {
                    if(current.length()>1 && current.charAt(0)=='0') continue;  // cannot start from a '0'
                    tem.append(current);
                    if(level!=3) tem.append(".");
                    restoreIpAddress(s, res, tem, i, level+1);
                    if(level!=3) tem.delete(tem.length()-1-(i-len), tem.length());
                    else tem.delete(tem.length()-(i-len), tem.length());
                }
            }
        }
        return;
    }
    
    public ArrayList<String> restoreIpAddresses(String s) {
        ArrayList<String> res = new ArrayList<String>();
        StringBuilder tem = new StringBuilder();
        restoreIpAddress(s, res, tem, 0, 0);    // the init value of level should be 0!!!
        return res;
    }
}