프로그래머스 연습문제 공원 산책 [JAVA] - 23년 3월 24일

class Solution {

    private char[][] map;
    private int[] answer;
    private int ROW;
    private int COL;

    public int[] solution(String[] park, String[] routes) {
        answer = new int[]{};

        ROW = park.length;
        COL = park[0].length();
        map = new char[ROW][COL];
        for (int r = 0; r < park.length; r++) {
            for (int c = 0; c < park[0].length(); c++) {
                char ch = park[r].charAt(c);
                map[r][c] = ch;

                if (ch == 'S') {
                    answer = new int[]{r, c};
                }
            }
        }

        for (String route : routes) {
            int[] newPos = getNewPos(route);

            if (newPos == null) {
                continue;
            }

            answer = newPos;
        }

        return answer;
    }

    private boolean isNotMoveable(int[] newPos, String dimention) {
        int curRow = answer[0];
        int curCol = answer[1];
        int newRow = newPos[0];
        int newCol = newPos[1];

        switch (dimention) {
            case "N":
                for (int i = 1; i <= Math.abs(newRow - curRow); i++) {
                    if (map[curRow - i][curCol] == 'X') {
                        return true;
                    }
                }
                break;
            case "S":
                for (int i = 1; i <= Math.abs(newRow - curRow); i++) {
                    if (map[curRow + i][curCol] == 'X') {
                        return true;
                    }
                }
                break;
            case "W":
                for (int i = 1; i <= Math.abs(newCol - curCol); i++) {
                    if (map[curRow][curCol - i] == 'X') {
                        return true;
                    }
                }
                break;
            case "E":
                for (int i = 1; i <= Math.abs(newCol - curCol); i++) {
                    if (map[curRow][curCol + i] == 'X') {
                        return true;
                    }
                }
                break;
            default:
                throw new IllegalStateException("Unexpected value: " + dimention);
        }

        return false;
    }

    private boolean isOutOfMap(int[] newPos) {
        int row = newPos[0];
        int col = newPos[1];
        return row < 0 || row >= ROW || col < 0 || col >= COL;
    }

    private int[] getNewPos(String route) {
        String[] arr = route.split(" ");
        String dimention = arr[0];
        int moveCount = Integer.parseInt(arr[1]);

        int newRow = 0;
        int newCol = 0;

        switch (dimention) {
            case "N":
                newRow = answer[0] - moveCount;
                newCol = answer[1];
                break;
            case "S":
                newRow = answer[0] + moveCount;
                newCol = answer[1];
                break;
            case "W":
                newRow = answer[0];
                newCol = answer[1] - moveCount;
                break;
            case "E":
                newRow = answer[0];
                newCol = answer[1] + moveCount;
                break;
            default:
                throw new IllegalStateException("Unexpected value: " + dimention);
        }

        if (isOutOfMap(new int[]{newRow, newCol}) || isNotMoveable(new int[]{newRow, newCol}, dimention)) {
            return null;
        }

        return new int[]{newRow, newCol};
    }
}