6-kjs254

kjs254/DFS/모음사전.py

@@ -0,0 +1,16 @@
+def dfs(my_word):
+    global dic
+    vowel = ['A','E','I','O','U']
+
+    if len(my_word)<=5:
+        dic.append(my_word)
+
+        for v in vowel:
+            dfs(my_word + v)
+
+def solution(word):
+    global dic
+    dic = []
+    dfs('')
+    answer = dic.index(word)
+    return answer

kjs254/README.md

@@ -4,7 +4,8 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  스택  | [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/2) |
 | 2차시 | 2024.02.15 | 큐 | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587) | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/6) |
-| 3차시 | 2024.02.15 | 힙 | [야근지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
-| 4차시 | 2024.02.15 | 힙 | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/14) |
-| 5차시 | 2024.02.15 | 힙 | [모음사전](https://school.programmers.co.kr/learn/courses/30/lessons/84512) | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/19) |
----
+| 3차시 | 2024.02.18 | 힙 | [야근지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
+| 4차시 | 2024.02.21 | 큐 | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/14) |
+| 5차시 | 2024.02.24 | DFS | [모음사전](https://school.programmers.co.kr/learn/courses/30/lessons/84512) | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/19) |
+| 6차시 | 2024.02.27 | 스택 | [괄호 회전하기](https://school.programmers.co.kr/learn/courses/30/lessons/76502) | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/22) |
+---

kjs254/스택/괄호 회전하기.py

@@ -0,0 +1,27 @@
+def func(bracket):
+    stk = []
+    for b in bracket:
+        if b in ["[","{","("]:
+            stk.append(b)
+        elif b in ["]","}",")"]:
+            if not stk:
+                return False
+            if stk[-1]=="[" and b=="]":
+                stk.pop()
+            elif stk[-1]=="{" and b=="}":
+                stk.pop()
+            elif stk[-1]=="(" and b==")":
+                stk.pop()
+            else:
+                return False
+    return not stk
+
+def solution(s):
+    answer = 0
+    l = len(s)
+    for i in range(l):
+        x = s[i:]+s[:i]
+        if func(x):
+            answer +=1
+
+    return answer

kjs254/큐/구명보트.py

@@ -0,0 +1,16 @@
+from collections import deque
+
+def solution(people, limit):
+    answer = 0
+    people = deque(sorted(people))
+
+    while len(people)>1:
+        if people[0]+people[-1]<=limit:
+            people.pop()
+            people.popleft()
+            answer+=1
+        else:
+            people.pop()
+            answer+=1
+
+    return answer+1 if people else answer