알고리즘 풀이/백준
[백준][Java] 10173번 니모를 찾아서(정규식)
배게
2021. 10. 9. 04:39
728x90
Patter/ Matcher/ 정규식 공부
|
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
35
36
37
38
39
40
41
42
|
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Main {
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) throws IOException{
String str;
Pattern pattern = Pattern.compile("[nN][eE][mM][oO]");
while(!(str=br.readLine()).equals("EOI")) {
Matcher matcher = pattern.matcher(str);
if(matcher.find())
System.out.println("Found");
else
System.out.println("Missing");
}
// bw.write("");
// bw.flush();
// bw.close();
}
private static int stoi(String input) {
return Integer.parseInt(input);
}
}
|
cs |