공원 산책

풀이

class Solution {
    public int[] solution(String[] park, String[] routes) {
        int h = park.length;
        int w = park[0].length();

        int startH = 0;
        int startW = 0;

        for(int i=0; i<h; i++){
            if(park[i].contains("S"))
            {
                startH = i;
                startW = park[i].indexOf("S"); 
            }
        } // 초기위치

        for(String route : routes){
            String d = route.split(" ")[0];
            int move = Integer.parseInt(route.split(" ")[1]);

            int moveH = startH;
            int moveW = startW;

            for(int i=0; i<move; i++)
            {
                switch(d) {
                    case "S" : moveH++; break; 
                    case "N" : moveH--; break;
                    case "E" : moveW++; break;
                    case "W" : moveW--; break;
                }
            if(moveH>=0&& moveH<h&&moveW>=0&&moveW<w){
                if(park[moveH].substring(moveW,moveW+1).equals("X")){
                    break;
                }
                if(i==move-1){
                    startH=moveH;
                    startW=moveW;
                }
                }    
            }

        }


        int[] answer = {startH,startW};
        return answer;
    }
}

 

프로그래머스