๋ชฉ๋กํž™ (1)

๐ŸŒฑ โ†’ ๐ŸŒณ

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๋” ๋งต๊ฒŒ - python

์ฝ”๋“œ ์‹œ๊ฐ„์ดˆ๊ณผ ์ฝ”๋“œ from collections import deque def solution(scoville, K): answer = 0 scoville = deque(scoville) while True: scoville = deque(sorted(scoville)) if scoville[0] >= K: break v1 = scoville.popleft() v2 = scoville.popleft() scoville.append(v1+(v2*2)) answer += 1 return answer ์‹ฌ์ง€์–ด ๋ช‡๋ช‡ํ…Œ์ŠคํŠธ ๋Ÿฐํƒ€์ž„์—๋Ÿฌ๋„ ๋ฐœ์ƒ deque ์‚ฌ์šฉํ•ด์„œ ์ƒˆ๋กœ์šด ์Šค์ฝ”๋นŒ์ง€์ˆ˜ ๋“ค์–ด์˜ฌ ๋•Œ ๋งˆ๋‹ค ์ •๋ ฌํ•ด์คŒ ๋‚ด๊ฐ€ ๋ด๋„ ๊ตฌ๋ฆฐ ์ฝ”๋“œ .. ์‹œ๊ฐ„์ดˆ๊ณผ ํ•ด๊ฒฐ ์ฝ”๋“œ from heapq import heapify, heappush,..
Algorithms 2023. 8. 2. 15:35
์ด์ „ Prev 1 Next ๋‹ค์Œ