leetcode JAVA Restore IP Addresses 难度系数3 3.33

最新推荐文章于 2022-03-23 14:42:22 发布

yundomo

最新推荐文章于 2022-03-23 14:42:22 发布

阅读量858

点赞数

本文链接：https://blog.csdn.net/yiding_he/article/details/18938083

版权

leetcode java 150 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Question：

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) {
      ArrayList<String> result = new ArrayList<String>();
      String ip = "";
      dfs(s,0,0,ip,result);
      return result;
    }

	private void dfs(String s, int start, int step, String ip, ArrayList<String> result) {
		if(start==s.length()&&step==4){
			ip = ip.substring(0,ip.length()-1);
			result.add(ip);
			return;
		}
		if(s.length()-start>(4-step)*3)
			return;
		if(s.length()-start<(4-step))
			return;
		int num = 0;
		for(int i=start;i<start+3;i++){
		    if(i>=s.length()){
		        break;
		    }
			num = num*10+(s.charAt(i)-'0');
			if(num<=255){
				ip+=s.charAt(i);
				dfs(s,i+1,step+1,ip+'.',result);
			}
			if(num==0)
				break;
		}
		
	}
}