[Programmers/Java/Lv.1/시뮬레이션] 79.[PCCE 기출문제] 9번 / 이웃한 칸

문제 설명

프로그래머스

 

나의 풀이

class Solution {
    public int solution(String[][] board, int h, int w) {
        int answer = 0;

        final int n = board.length;
        final int m = board[0].length;

        if(0 <= h - 1){
            if(board[h - 1][w].equals(board[h][w])){
                answer++;
            }
        }
        if(h + 1 < n){
            if(board[h + 1][w].equals(board[h][w])){
                answer++;
            }
        }
        if(0 <= w - 1){
            if(board[h][w - 1].equals(board[h][w])){
                answer++;
            }
        }
        if(w + 1 < m){
            if(board[h][w + 1].equals(board[h][w])){
                answer++;
            }
        }
        
        return answer;
    }
}

 

다른 풀이

class Solution {
    public int solution(String[][] board, int h, int w) {
        int n = board.length; 
        int count = 0; 
        int[] dh = { 0, 1, -1, 0}; int[] dw = {1,0,0,-1};

        for(int i = 0; i < 4; i++){
            int h_check = h + dh[i]; 
            int w_check = w + dw[i];
            if(h_check >= 0 && h_check < n && w_check >= 0 && w_check < n){
                if(board[h][w].equals(board[h_check][w_check])){
                    count++;
                }
            }
        }
        return count;
    }
}