[アルゴリズム]貪欲(Greedy,Greedy)

🕯️コンセプト

👩‍💻 コード#コード#

n = 1260
count = 0

coin_types = [500, 100, 50, 10]

for coin in coin_types:
	count += n // coin # 해당 화폐로 거슬러 줄 수 있는 동전의 개수 세기
	n %= coin

print(count)

💭 いつ必要ですか。

👑 例

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]
    
	  # 정렬 꼭 필요
    _lost.sort()
    _reserve.sort()
    
    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)

def solution(name):
    answer = 0

    changed = []
    for c in name:
        changed.append(min(ord(c)-ord('A'), ord('Z')-ord(c)+1))
    
    idx = 0
    while True:
            
        answer += changed[idx]
        changed[idx] = 0
        
        if sum(changed) == 0:
            break

        left, right = 1, 1
        while changed[idx-left] == 0:
            left += 1
        while changed[idx+right] == 0:
            right += 1
        
        if left <= right:
            answer += left
            idx -= left
        else:
            answer += right
            idx += right
    
    return answer