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)

题目链接

题目描述
给定一个字符串，看能构成多少种IP地址。
思路
IP地址的每一位的值是在0到255之间，没有前导零，运用StringBuffer来存储即可。

public class RestoreIP {
    ArrayList<String> result; 
    public ArrayList<String> restoreIpAddresses(String s) {
        result = new ArrayList<>();
        StringBuilder sb = new StringBuilder("");
        parse(s,0,4,sb);
        return result;
    }

    private void parse(String s,int start,int num,StringBuilder buffer) {
        if ( num==0 ) 
            return ; 

        String t = null ;
        int value = 0 ; 
        for ( int len=1; len<=3; len++ ) {
            //修改一次!
            if ( start+len>s.length() || (s.charAt(start)=='0'&&len!=1) )
                return; 

            t = s.substring(start, start+len);
            value = Integer.parseInt(t);

            if ( value<256 ) {
                buffer.append(t);
                if ( num!=1 ) {
                    buffer.append("."); 
                    parse(s, start+len, num-1, buffer);
                    buffer.delete(buffer.length()-1-len, buffer.length() );
                } else {
                    if ( s.length()==start+len ) 
                        result.add(buffer.toString());
                    buffer.delete(buffer.length()-len, buffer.length() );
                }

            }
        }
    }
}