[구현] 프로그래머스 행렬 테두리 회전하기

문제링크 programmers.co.kr/learn/courses/30/lessons/77485

 

 

 

[답코드]

def solution(rows, columns, queries):
    answer = []
    graph = [[] for _ in range(rows)]
    value = 1
    for i in range(rows):
        for j in range(columns):
            graph[i].append(value)
            value += 1

    for x1, y1, x2, y2 in queries:
        x1, y1, x2, y2 = x1-1, y1-1, x2-1, y2-1
        tmp = graph[x1][y1]
        min_v = tmp
        
        for x in range(x1, x2):
            graph[x][y1] = graph[x + 1][y1]
            min_v = min(min_v, graph[x + 1][y1])
            
        for y in range(y1, y2):
            graph[x2][y] = graph[x2][y+1]
            min_v = min(min_v, graph[x2][y+1])
            
        for x in range(x2, x1, -1):
            graph[x][y2] = graph[x-1][y2]
            min_v = min(min_v, graph[x-1][y2])
            
        for y in range(y2, y1, -1):
            graph[x1][y] = graph[x1][y-1]
            min_v = min(min_v, graph[x1][y-1])
            
        graph[x1][y1+1]=tmp
        answer.append(min_v)
        
    return answer

 

 

[느낀점]

for y in range(5, 1, -1) #5, 4, 3, 2
for y in range(1, 5) #1, 2, 3, 4

두 for 문이 왠지 계속 헷갈렸는데 이번에 확실히 정립됐다.

둘 다 하나 모자라게 나온다고 생각하면 편하다