Skip to content

Commit cfba431

Browse files
committed
[level 2] Title: 기능개발, Time: 0.06 ms, Memory: 9.02 MB -BaekjoonHub
1 parent 12eff93 commit cfba431

File tree

2 files changed

+9
-8
lines changed

2 files changed

+9
-8
lines changed

프로그래머스/2/42586. 기능개발/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
# [level 2] 기능개발 - 42586
22

3-
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/42586#qna)
3+
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/42586)
44

55
### 성능 요약
66

7-
메모리: 10.2 MB, 시간: 0.04 ms
7+
메모리: 9.02 MB, 시간: 0.06 ms
88

99
### 구분
1010

@@ -16,7 +16,7 @@
1616

1717
### 제출 일자
1818

19-
2024년 10월 09일 16:31:51
19+
2025년 04월 09일 16:00:58
2020

2121
### 문제 설명
2222

Lines changed: 6 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,13 @@
11
import math
22

33
def solution(progresses, speeds):
4-
progresses = [math.ceil((100 - a) / b) for a, b in zip(progresses, speeds)]
4+
arr = [math.ceil((100-a) / b) for a, b in zip(progresses, speeds)]
55
ans = []
66
front = 0
7-
for i in range(len(progresses)):
8-
if progresses[i] > progresses[front]:
9-
ans.append(i - front)
7+
print(arr)
8+
for i in range(len(arr)):
9+
if arr[i] > arr[front]:
10+
ans.append(i-front)
1011
front = i
11-
ans.append(len(progresses) - front)
12+
ans.append(len(arr) - front)
1213
return ans

0 commit comments

Comments
 (0)