Merge pull request #120 from YoonYn9915/main

YoonYn9915 / 1월 2주차 / 3문제

Author: YoonYn9915

YoonYn9915/implementation/2025-01-11-[프로그래머스]-요격 시스템.py

@@ -0,0 +1,11 @@
+def solution(targets):
+    answer = 0
+    targets.sort(key=lambda x: [x[1], x[0]])
+
+    s = e = 0
+    for target in targets:
+        if target[0] >= e:
+            answer += 1
+            e = target[1]
+
+    return answer

YoonYn9915/implementation/2025-01-11-[프로그래머스]-자물쇠와 열쇠.py

@@ -0,0 +1,52 @@
+# 배열 rotation
+def rotation(arr):
+    retArr = [[0] * len(arr) for _ in range(len(arr))]
+    # 11 > 13 / 12 > 23 / 13 > 33
+    for i in range(len(arr)):
+        for j in range(len(arr)):
+            retArr[j][len(arr) - 1 - i] = arr[i][j]
+    return retArr
+
+
+# 정값 체크
+def checkSol(keyArr, lockArr, x, y):
+    keySize = len(keyArr)
+    lockSize = len(lockArr)
+
+    boardSize = lockSize * 3
+    board = [[0] * (boardSize) for _ in range(boardSize)]
+
+    start = lockSize - 1
+    end = start + lockSize
+
+    # boardArr 에 lock 삽입
+    for i in range(lockSize):
+        for j in range(lockSize):
+            board[start + i][start + j] += lockArr[i][j]
+
+    # boardArr 에 key 삽입
+    for i in range(keySize):
+        for j in range(keySize):
+            board[i + x][j + y] += keyArr[i][j]  # 값 복사
+
+    # 전부 1인지 체크
+    for i in range(start, end):
+        for j in range(start, end):
+            if board[i][j] != 1:
+                return False
+    return True
+
+
+def solution(key, lock):
+    for _ in range(4):
+
+        # 값 이동
+        for x in range((len(lock) * 2) - 1):
+            for y in range((len(lock) * 2) - 1):
+                if checkSol(key, lock, x, y) == True:
+                    return True
+
+        # key 회전
+        key = rotation(key)
+
+    return False

YoonYn9915/implementation/2025-01-11-[프로그래머스]-표 병합.py

@@ -0,0 +1,42 @@
+def solution(commands):
+    answer = []
+    graph = [[(i, j) for j in range(50)] for i in range(50)]
+    value = [["EMPTY"] * 50 for _ in range(50)]
+    for command in commands:
+        command = command.split(' ')
+        if command[0] == 'UPDATE':
+            if len(command) == 4:
+                r,c,value = int(command[1])-1,int(command[2])-1,command[3]
+                x,y = graph[r][c]
+                value[x][y] = value
+            elif len(command) == 3:
+                value1, value2 = command[1], command[2]
+                for i in range(50):
+                    for j in range(50):
+                        if value[i][j] == value1:
+                            value[i][j] = value2
+        elif command[0] == 'MERGE':
+            r1,c1,r2,c2 = int(command[1])-1, int(command[2])-1, int(command[3])-1, int(command[4])-1
+            x1,y1 = graph[r1][c1]
+            x2,y2 = graph[r2][c2]
+            if value[x1][y1] == "EMPTY":
+                value[x1][y1] = value[x2][y2]
+            for i in range(50):
+                for j in range(50):
+                    if graph[i][j] == (x2,y2):
+                        graph[i][j] = (x1,y1)
+        elif command[0] == 'UNMERGE':
+            r, c = int(command[1])-1,int(command[2])-1
+            x, y = graph[r][c]
+            tmp = value[x][y]
+            for i in range(50):
+                for j in range(50):
+                    if graph[i][j] == (x,y):
+                        graph[i][j] = (i,j)
+                        value[i][j] = "EMPTY"
+            value[r][c] = tmp
+        elif command[0] == 'PRINT':
+            r, c = int(command[1])-1, int(command[2])-1
+            x, y = graph[r][c]
+            answer.append(value[x][y])
+    return answer