forked from SedaKunda/hackerrank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPatternSyntax.java
More file actions
34 lines (28 loc) · 1.08 KB
/
PatternSyntax.java
File metadata and controls
34 lines (28 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
In this problem, you are given a pattern. You have to check whether the syntax of the given pattern is valid.
Note: In this problem, a regex is only valid if you can compile it using the Pattern.compile method.
Input Format
The first line of input contains an integer NN, denoting the number of testcases. The next NN lines contain a string of any printable characters representing the pattern of a regex.
Output Format
For each testcase, print "Valid" if the syntax of the given pattern is correct. Otherwise, print "Invalid". Do not print the quotes.
*/
import java.util.Scanner;
import java.util.regex.*;
public class PatternSyntax
{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
in.nextLine();
for (int i = 0; i < n; i++) {
String pattern = in.nextLine();
try {
Pattern p = Pattern.compile(pattern);
System.out.println("Valid");
}
catch (PatternSyntaxException e) {
System.out.println("Invalid");
}
}
}
}