Leetcode: Restore IP Address

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)

public class Solution {
    public ArrayList<String> restoreIpAddresses(String s) {
		// Start typing your Java solution below
		// DO NOT write main() function
		ArrayList<String> res = new ArrayList<String>();
		String cur = "";
		restore(res, cur, s, 4);
		return res;
	}
	public void restore(ArrayList<String> res, String cur, String s, int left){
		if(left == 0){
			if(s.length() == 0){
				res.add(cur.substring(0, cur.length() - 1));
				return;
			}
		}
		if(left * 3 < s.length())
			return;
		int num = 0;
		if(s.length() > 0){
			num = Integer.parseInt(s.substring(0, 1));
			if(num >= 0 && num < 256){
				String temp = cur + s.substring(0, 1) + ".";
				restore(res, temp, s.substring(1), left - 1);
			}
		}
		if(s.length() > 1){
			if(s.charAt(0) == '0')
				return;
			num = Integer.parseInt(s.substring(0, 2));
			if(num >= 0 && num < 256){
				String temp = cur + s.substring(0, 2) + ".";
				restore(res, temp, s.substring(2), left - 1);
			}
		}
		if(s.length() > 2){
			if(s.charAt(0) == '0')
				return;
			num = Integer.parseInt(s.substring(0, 3));
			if(num >= 0 && num < 256){
				String temp = cur + s.substring(0, 3) + ".";
				restore(res, temp, s.substring(3), left - 1);
			}
		}
	}
}

public class Solution {
    public ArrayList<String> restoreIpAddresses(String s) {
		// Start typing your Java solution below
		// DO NOT write main() function
		ArrayList<String> res = new ArrayList<String>();
		String cur = "";
		restore(res, cur, s, 0, 4);
		return res;
	}

	public void restore(ArrayList<String> res, String temp, String s,
			int start, int left) {
		if (left == 0) {
			if (start == s.length()) {
				res.add(temp.substring(1));
			}
			return;
		}
		int x = 0;
		for (int i = start; i < start + 4 && i < s.length(); ++i) {
			x = x * 10 + s.charAt(i) - '0';
			if (x > 255 || x < 0)
				break;
			String str = temp + ".";
			String part = s.substring(start, i + 1);
			if (part.length() > 1 && part.charAt(0) == '0')
				break;
			str += part;
			restore2(res, str, s, i + 1, left - 1);
		}
	}
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值