https://programmers.co.kr/learn/courses/30/lessons/42862
def solution(n, lost, reserve):
students = [-1] + ([1] * n)
students[0] = -1
for i in lost:
students[i] -= 1
for i in reserve:
students[i] += 1
for i in range(1,n+1):
if students[i] > 1:
if students[i-1] == 0:
students[i-1] += 1
students[i] -= 1
elif n > i and students[i+1] == 0:
students[i+1] += 1
students[i] -= 1
count = 0;
for i in range(1, n+1):
if students[i] > 0:
count += 1
return count
--> 요게 더 낫다
'2022 스터디 > 알고리즘 스터디[2022]' 카테고리의 다른 글
정렬 (0) | 2023.03.18 |
---|---|
[DFS/BFS] 타겟 넘버 (0) | 2022.05.02 |
[해시] 완주하지 못한 선수 (0) | 2022.04.11 |