2차원 배열 회전

#오른 위 왼 아래
dx = [0, -1, 0, 1]
dy = [1, 0, -1, 0]
#반시계방향

d = 0
    before = 0
    x, y = p, 1
    while True:
        nx = x + dx[d]
        ny = y + dy[d]
        if nx == r or ny == c or nx == -1 or ny == -1:
            d = (d+1)%4
            continue
        if x == p and y == 0:
            break
        room[x][y], before = before, room[x][y]
        x, y = nx, ny
#시계방향
p = purifier[1]
    #오른쪽부터 시작
    d = 0
    before = 0
    x, y = p, 1
    while True:
        nx = x + dx[d]
        ny = y + dy[d]
        if nx == r or ny == c or nx == -1 or ny == -1:
            d = (d - 1) % 4
            continue
        if x == p and y == 0:
            break
        room[x][y], before = before, room[x][y]
        x, y = nx, ny