Search

์กฐ์˜ˆ์ง€

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
1800
4. git ์ฃผ์†Œ URL
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
from collections import deque import math def solution(progresses, speeds): answer = [] queue = deque(progresses) cnt = 0 idx = 0 day = math.ceil((100-progresses[0])/speeds[0]) while queue: now = queue.popleft() wd = math.ceil((100-now)/speeds[idx]) if wd <= day: cnt += 1 else: answer.append(cnt) cnt = 1 day = wd idx += 1 answer.append(cnt) return answer
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ
1.
๊ฐ ๊ธฐ๋Šฅ์„ ํ•˜๋‚˜์”ฉ ๊ฐ€์ ธ์™€์„œ ๊ฐœ๋ฐœํ•˜๋Š”๋ฐ ์–ผ๋งˆ๋‚˜ ๊ฑธ๋ฆฌ๋Š” ์ง€ (wd) ๊ตฌํ•œ๋‹ค.
a.
์ด์ „์— ๊บผ๋ƒˆ๋˜ ๊ฒƒ๋ณด๋‹ค ์ž‘์œผ๋ฉด ๊ฐ™์ด ๋ฐฐํฌ๋ฅผ ํ•  ์ˆ˜ ์žˆ์œผ๋ฏ€๋กœ cnt๋ฅผ 1์˜ฌ๋ฆฐ๋‹ค.
b.
๋” ํฌ๋ฉด ๋‹ค์Œ ๋ฐฐํฌ์— ํฌํ•จ๋˜๋ฏ€๋กœ ์•ž์˜ cnt๋ฅผ answer์— ์ถ”๊ฐ€ํ•˜๊ณ , ์ž‘์—… ๋‚ ์งœ๋ฅผ ์ดˆ๊ธฐํ™”ํ•œ๋‹ค.
2.
speed๋ฅผ ๊ฐ€์ ธ์˜ค๊ธฐ ์œ„ํ•œ idx๋ฅผ 1 ๋Š˜๋ฆฐ๋‹ค.
3.
์‚ฌ์‹ค idx๋ฅผ ์“ธ๊ฑฐ๋ฉด deque๋ฅผ ์‚ฌ์šฉํ•˜์ง€ ์•Š์•˜์–ด๋„ ๋˜์—ˆ์„ ๊ฒƒ ๊ฐ™๋‹ค.