[백준][Java] 10173번 니모를 찾아서(정규식)

Patter/ Matcher/ 정규식 공부

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);
    }
}