Hackerrank – Java Solution – Java Regex Solution

Hackerrank - Java Solutions Hackerrank Online Judge Solution

Hackerrank – Java Solution – Java Regex Solution

HackerRank Problem Solution

Problem Name – Java Regex
Problem Link –  Java Regex 
Level – String

Java Only Submitted Code

/*
[01]?\d{1,2} matches numbers 0-199.
2[0-4]\d matches numbers 200-249
25[0-5] matches numbers 250-255
*/
class MyRegex {
String num = "([01]?\d{1,2}|2[0-4]\d|25[0-5])";
String pattern = num + "." + num + "." + num + "." + num;
}

Java Full Source Code

import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.Scanner;

class Solution{

public static void main(String[] args){
Scanner in = new Scanner(System.in);
while(in.hasNext()){
String IP = in.next();
System.out.println(IP.matches(new MyRegex().pattern));
}

}
}
/*
[01]?\d{1,2} matches numbers 0-199.
2[0-4]\d matches numbers 200-249
25[0-5] matches numbers 250-255
*/
class MyRegex {
String num = "([01]?\d{1,2}|2[0-4]\d|25[0-5])";
String pattern = num + "." + num + "." + num + "." + num;
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution, Hackerrank – Java Solution – Java Regex Solution, Hackerrank Online Judge Solution, Hackerrank – Java Solutions,

Leave a Reply

Your email address will not be published.