PROGRAMMERS 68645: 삼각 달팽이

Link : programmers.co.kr/learn/courses/30/lessons/68645

---

Programming Language

def solution(n):
    answer = [[0 for _ in range(n)] for _ in range(n)]
 
    dir_value = 0
    counting = 1
    pos = [0, 0]  # x, y
    for i in range(n, 0, -1):
        for j in range(i):
            if dir_value % 3 == 0:  # down
                answer[pos[1]][pos[0]] = counting
                pos[1] += 1
            elif dir_value % 3 == 1:  # right
                answer[pos[1]][pos[0]] = counting
                pos[0] += 1
            elif dir_value % 3 == 2:  # up left
                answer[pos[1]][pos[0]] = counting
                pos[0] -= 1
                pos[1] -= 1
            counting += 1
        if dir_value % 3 == 0:
            pos[1] -= 1
            pos[0] += 1
        elif dir_value % 3 == 1:
            pos[1] -= 1
            pos[0] -= 2
        elif dir_value % 3 == 2:
            pos[0] += 1
            pos[1] += 2
        dir_value += 1
    result = []
    for i in answer:
        for j in i:
            if j != 0:
                result.append(j)
    return result

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com