Closed ji-0630 closed 1 year ago
def solution(num, total):
std = total // num
n = (num - 1)//2
if num % 2 == 0:
return sorted([std-i for i in range(1, n+1)] + [std] + [std+i for i in range(1, n+2)])
else:
return sorted([std-i for i in range(1, n+1)] + [std] + [std+i for i in range(1, n+1)])
def solution(num, total):
if num % 2 == 1:
return list(range(total//num-num//2, total//num+num//2+1))
else:
return list(range(total//num-num//2+1, total//num+num//2+1))
def solution(num, total):
n = (num-1)//2
k = total // num
if num % 2 == 0:
answer = [k-i for i in range(1, n+1)] + [k] + [k+i for i in range(1, n+2)]
else:
answer = [k-i for i in range(1, n+1)] + [k] + [k+i for i in range(1, n+1)]
return sorted(answer)
문제 설명