Open ji-0630 opened 1 year ago
def solution(n, left, right):
answer = []
for i in range(1, n+1):
for j in range(1, n+1):
answer.append(max(i, j))
return answer[left : right+1]
def solution(n, left, right):
answer = []
for i in range(left, right + 1):
answer.append(max(i // n, i % n) + 1)
return answer
문제 설명