Search

์ตœ์•„์˜

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
2500
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
from collections import deque import math def solution(progresses, speeds): q = deque() answer = [] for progress, speed in zip(progresses, speeds): q.append(math.ceil((100 - progress) / speed)) d = q[0] q.popleft() count = 1 while q: if q[0] <= d: count += 1 q.popleft() else: answer.append(count) count = 0 d = q[0] answer.append(count) return answer
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ
์ž‘์—…์ด ๋ฉฐ์น  ๋‚จ์•˜๋Š”์ง€ ๊ณ„์‚ฐํ•ด ํ์— ๋‹ด์•„ ์ค€๋‹ค. ํ์˜ ์ฒซ ๋ฒˆ์งธ ๊ฐ’์„ ๊ธฐ์ค€์œผ๋กœ ๊ธฐ์ค€ ๊ฐ’๋ณด๋‹ค ์ž‘๊ฑฐ๋‚˜ ๊ฐ™๋‹ค๋ฉด ๊ฐ™์ด ๋ฐฐํฌ ๋˜๋ฏ€๋กœ ๊ฐœ์ˆ˜๋ฅผ ์ฆ๊ฐ€์‹œํ‚ค๋ฉด์„œ ํ์—์„œ ์ œ๊ฑฐํ•œ๋‹ค. ์™„์„ฑ๋˜์ง€ ์•Š์€ ๊ธฐ๋Šฅ์ด ๋‚˜์˜ค๋ฉด ๋ฐฐํฌ๋œ ๊ฐœ์ˆ˜๋ฅผ ๋ฐฐ์—ด์— ๋‹ด๊ณ  0์œผ๋กœ ์ดˆ๊ธฐํ™” ํ•œ ํ›„ ๊ธฐ์ค€ ๊ฐ’์„ ํ˜„์žฌ ํ์˜ ์ฒซ๋ฒˆ์งธ ๊ฐ’์œผ๋กœ ๋ฐ”๊พผ๋‹ค. ํ๊ฐ€ ๋นŒ ๋•Œ๊นŒ์ง€ ๋ฐ˜๋ณตํ•˜๊ณ  ๋งˆ์ง€๋ง‰ ๊ฐœ์ˆ˜๊นŒ์ง€ ๋ฐฐ์—ด์— ๋‹ด์•„ ๋ฆฌํ„ดํ•œ๋‹ค.