leetcode -- 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)

[解题思路]

DFS + Backtracking

给定的字符串分成4段，每段都0<= m <= 255

DFS 终止条件：

1. 剩余位数 > 剩余段数*3

2. 剩余位数 < 剩余段数

3. depth == 4

 

给定的字符串每一位都必须出现在最后生成的ip中，一开始没有注意

当输入为：“010010”

未加line38-40 输出：[0.1.0.10, 0.1.1.0, 0.10.0.10, 0.10.1.0, 0.100.1.0, 1.0.0.10, 1.0.1.0, 10.0.1.0]

系统期望输出为：[0.10.0.10, 0.100.1.0]

故当某一位出现在为0时，则break，停止继续计算num，该位就为0

public static ArrayList<String> restoreIpAddresses(String s) {
        // Start typing your Java solution below
        // DO NOT write main() function
        ArrayList<String> result = new ArrayList<String>();
        if (s == null || s.length() == 0) {
            return result;
        }
        int depth = 0, start = 0;
        String ip = "";
        generate(s, start, depth, result, ip);

        return result;
    }

    private static void generate(String s, int start, int depth,
            ArrayList<String> result, String ip) {
        // max = 3 check it
        if ((s.length() - start) > (4 - depth) * 3) {
            return;
        }
        // min = 1 check it
        if (s.length() - start < 4 - depth) {
            return;
        }
        if (depth == 4) {
            ip = ip.substring(0, ip.length() - 1);
            if(!result.contains(ip))
                result.add(ip);
            return;
        }

        int num = 0;
        for (int i = start; i < Math.min(start + 3, s.length()); i++) {
            num = num * 10 + (s.charAt(i) - '0');
            if (num <= 255) {
                generate(s, i + 1, depth + 1, result, ip + num + ".");
            }
            if(num == 0){
                break;
            }
        }
    }