



나의 풀이
class Solution {
public int solution(String[][] board, int h, int w) {
int answer = 0;
String currColor = board[h][w];
int n = board.length;
int[] dh = {0, 1, -1, 0};
int[] dw = {1, 0, 0, -1};
for (int i = 0; i <= 3; 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_check][w_check].equals(currColor)) {
answer++;
}
}
}
return answer;
}
}
과정
- 문제에 표현된 과정대로 풀었습니다
다른 사람 풀이
class Solution {
public int solution(String[][] board, int h, int w) {
int answer = 0;
String sC = board[h][w];
if(h > 0 && sC.equals(board[h-1][w])) answer++;
if(h < board.length - 1 && sC.equals(board[h+1][w])) answer++;
if(w > 0 && sC.equals(board[h][w-1])) answer++;
if(w < board[h].length - 1 && sC.equals(board[h][w+1])) answer++;
return answer;
}
}