[프로그래머스] [PCCE 기출문제] 9번 이웃한 칸 (Python)

문제

https://school.programmers.co.kr/learn/courses/30/lessons/250125

프로그래머스

 

 

코드

def solution(board, h, w):
    n=len(board)
    count=0
    dh=[0, 1, -1, 0]
    dw=[1, 0, 0, -1]
    for i in range(0,4):
        h_check=h + dh[i]
        w_check=w + dw[i]
        if(h_check >=0 and h_check<n and w_check >=0 and w_check<n ):
            if(board[h][w] == board[h_check][w_check]) :
                count=count+1
    
    answer = count
    return answer