Merge pull request #2 from kjs254/1-kjs254

1-kjs254

kjs254/README.md

@@ -2,5 +2,6 @@
 
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2023.10.27 |  BFS  | -  | - |
----
+| 1차시 | 2024.02.12 |  스택  | [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)  | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/2) |
+| 2차시 | 2024.02.15 |  큐  | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/issues/6)  |
+---

kjs254/스택/기능개발.py

@@ -0,0 +1,25 @@
+def solution(progresses, speeds):
+    answer = []
+    days = []
+    stk = []
+
+    for i,p in enumerate(progresses):
+        term = 100-p
+        s = speeds[i]
+
+        if term%s==0:
+            days.append(term//s)
+        else:
+            days.append(term//s+1)
+
+    while days:
+        if not stk:
+            stk.append(days.pop(0))
+        elif max(stk)>=days[0]:
+            stk.append(days.pop(0))
+        else:
+            answer.append(len(stk))
+            stk.clear()
+
+    answer.append(len(stk))
+    return answer