programmers.co.kr/learn/courses/30/lessons/68645 코딩테스트 연습 - 삼각 달팽이 5 [1,2,12,3,13,11,4,14,15,10,5,6,7,8,9] 6 [1,2,15,3,16,14,4,17,21,13,5,18,19,20,12,6,7,8,9,10,11] programmers.co.kr def solution(n): n_list = [[0] * i for i in range(1, 1 + n)] max_val = (n ** 2 + n) // 2 cnt = 0 x, y = 0, 0 direction = [(1, 0), (0, 1), (-1, -1)] dir_num = 0 while cnt < max_val: cnt += 1 n_list[x][y] = cnt dx = x..