Merge pull request #123 from AlgorithmStudy-Allumbus/minjeong

Minjeong / 1월 3주차 / 5문제

Author: Mingguriguri

minjeong/DynamicProgramming/2025-01-13-[백준]-#5582-공통부분문자열.py

@@ -0,0 +1,19 @@
+import sys
+input = sys.stdin.readline
+
+# 입력
+S1 = input().strip()
+S2 = input().strip()
+
+# DP 초기화
+dp = [[0] * (len(S1) + 1) for _ in range(len(S2) + 1)]
+
+# DP 채우기
+for i in range(1, len(S2)+1):
+    for j in range(1, len(S1)+1):
+        if S2[i-1] == S1[j-1]:
+            # 이전 값을 그대로 가져오거나 직전 문자열이 이어지고 있다면 +1 하거나
+            dp[i][j] = dp[i-1][j-1] + 1
+
+# 정답 출력
+print(max(max(row) for row in dp))

minjeong/DynamicProgramming/2025-01-14-[백준]-#20542-받아쓰기.py

@@ -0,0 +1,30 @@
+import sys
+input = sys.stdin.readline
+
+# 입력
+n, m = map(int, input().split())
+write_str = " " + input().strip()
+answer_str = " " + input().strip()
+
+# DP
+dp = [[0] * (n + 1) for _ in range(m + 1)]
+
+# 공집합 채우기
+for i in range(1, m + 1):
+    dp[i][0] = i
+for j in range(1, n + 1):
+    dp[0][j] = j
+
+# 최소 편집으로 DP 채우기
+for i in range(1, m + 1):
+    for j in range(1, n + 1):
+        if write_str[j] == answer_str[i] or \
+                (write_str[j] == 'i' and answer_str[i] == 'j') or \
+                (write_str[j] == 'i' and answer_str[i] == 'l') or \
+                (write_str[j] == 'v' and answer_str[i] == 'w'):
+            dp[i][j] = dp[i - 1][j - 1]
+        else:
+            dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1
+
+# 정답 출력
+print(dp[m][n])

minjeong/DynamicProgramming/2025-01-15-[백준]-#17218-비밀번호만들기.py

@@ -0,0 +1,24 @@
+import sys
+input = sys.stdin.readline
+
+# 입력 및 초기화
+S1 = input().strip()
+S2 = input().strip()
+n, m = len(S1), len(S2)
+dp = [[""] * (m+1) for _ in range(n+1)]
+
+# DP 채우기
+for i in range(1, n+1):
+    for j in range(1, m+1):
+        # 문자가 같으면 이전 값에 현재 문자 더하기
+        if S1[i-1] == S2[j-1]:
+            dp[i][j] = dp[i-1][j-1] + S1[i-1]
+        # 문자가 다르면 더 긴 걸로 선택
+        else:
+            if len(dp[i-1][j]) > len(dp[i][j-1]):
+                dp[i][j] = dp[i-1][j]
+            else:
+                dp[i][j] = dp[i][j-1]
+
+# 정답 출력
+print(dp[n][m])

minjeong/Heap/2025-01-18-[Programmers]-더맵게.py

@@ -0,0 +1,19 @@
+import heapq
+
+
+def solution(scoville, K):
+    answer = 0
+    heapq.heapify(scoville)
+
+    while len(scoville) > 1:
+
+        if scoville[0] >= K:
+            return answer
+        mix_scoville = heapq.heappop(scoville) + (heapq.heappop(scoville) * 2)
+        answer += 1
+        heapq.heappush(scoville, mix_scoville)
+
+    if scoville[0] >= K:
+        return answer
+    else:
+        return -1

minjeong/Stack, Queue/2025-01-18-[Programmers]-#주식가격.py

@@ -0,0 +1,11 @@
+def solution(prices):
+    answer = [0] * len(prices)
+    stack = []
+
+    for idx, p in enumerate(prices):
+        while stack and (p < prices[stack[-1]] or idx == len(prices) - 1):
+            last = stack.pop()
+            answer[last] = idx - last
+        stack.append(idx)
+
+    return answer