programmers | Lv1. ์ฒด์œก๋ณต [Python]

yeonkยท2022๋…„ 2์›” 24์ผ
0

algorithm

๋ชฉ๋ก ๋ณด๊ธฐ
41/88
post-thumbnail

๐Ÿ’ก Python 3






๐Ÿ”— ๋ฌธ์ œ

์ฒด์œก๋ณต [Link]






๐Ÿ’ป ์ฝ”๋“œ

def solution(n, l, r):
    answer = 0
    for i in range(1, n+1):
        if i in l:
            if i in r: 
                answer += 1
                r.remove(i)
            elif i-1 in r and i-1 not in l:
                answer += 1
                r.remove(i-1)
            elif i+1 in r and i+1 not in l:
                answer += 1
                r.remove(i+1)
        else:
            answer += 1    
    return answer






๐Ÿ’ฅ ๋‹ค๋ฅธ ์‚ฌ๋žŒ ์ฝ”๋“œ

def solution(n, lost, reserve):
    _reserve = [r for r in reserve if r not in lost]
    _lost = [l for l in lost if l not in reserve]
    for r in _reserve:
        f = r - 1
        b = r + 1
        if f in _lost:
            _lost.remove(f)
        elif b in _lost:
            _lost.remove(b)
    return n - len(_lost)

0๊ฐœ์˜ ๋Œ“๊ธ€