kakao coding test

SoniaComp · SoniaComp · commit 7fa24ec1124a · 2021-04-03T10:52:56.000+09:00
diff --git a/Iwanttogo/bisect/bisect.py b/Iwanttogo/bisect/bisect.py
@@ -0,0 +1,12 @@
+from bisect import bisect, bisect_left
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        N = len(nums)
+        half = target // 2
+        half_idx = bisect(nums, target)
+        for i, num in enumerate(nums[:half_idx]):
+            new_target = target - num
+            idx = bisect_left(nums, new_target, i+1)
+            if idx < len(nums) and nums[idx] == new_target:
+                return [i+1, idx+1]
+        
diff --git a/Iwanttogo/bisect/bisect_2.py b/Iwanttogo/bisect/bisect_2.py
@@ -0,0 +1,22 @@
+from bisect import bisect
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        # 에외처리
+        if not matrix:
+            return False
+        
+        # 첫행의 맨뒤
+        row = 0
+        col = len(matrix[0]) - 1
+        
+        while row <= len(matrix) -1 and col >= 0:
+            if target == matrix[row][col]:
+                return True
+            # 타겟이 작으면 왼쪽으로 이동
+            elif target < matrix[row][col]:
+                col -= 1
+            # 타겟이 크면 아래로 이동
+            elif target > matrix[row][col]:
+                row -= 1
+        return False
+        
diff --git a/programmers/2019internship/crane_1.py b/programmers/2019internship/crane_1.py
@@ -0,0 +1,22 @@
+from collections import deque
+def solution(board, moves):
+    board = list(map(list, list(zip(*board[::-1]))))
+    basket = []
+    cnt = 0
+    for move in moves:
+        cur_b = board[move-1]
+        if not cur_b:
+            continue
+        cur = None
+        while cur_b:
+            cur = cur_b.pop()
+            if cur:
+                break
+        if not cur:
+            continue
+        if basket and basket[-1] == cur:
+            cnt += 2
+            basket.pop()
+        else:
+            basket.append(cur)
+    return cnt
diff --git a/programmers/2019internship/crane_2.py b/programmers/2019internship/crane_2.py
@@ -0,0 +1,18 @@
+def solution(board, moves):
+  stacklist = []
+  answer = 0
+
+  for i in moves:
+    for j in range(len(board)):
+      if board[j][i-1] != 0:
+        stacklist.append(board[j][i-1])
+        # 먼저 스택에 넣고 비교한다.
+        board[j][i-1] = 0
+        
+        if len(stacklist) > 1:
+          if stacklist[-1] == stacklist[-2]:
+            stacklist.pop(-1)
+            stacklist.pop(-1)
+            answer += 2
+        break
+  return answer
diff --git a/programmers/2019internship/failure_1.py b/programmers/2019internship/failure_1.py
@@ -0,0 +1,13 @@
+from collections import Counter
+def solution(N, stages):
+    answer = [] # (stage, 실패율)
+    c = Counter(stages)
+    all_num = len(stages)
+    try_num = all_num
+    for i in range(1, N+1):
+        if try_num <= 0:
+            answer.append((i, 0))
+            continue
+        answer.append((i, c[i]/try_num))
+        try_num = try_num - c[i]
+    return list(map(lambda x: x[0], sorted(answer, key=lambda x: x[1], reverse=True)))
diff --git a/programmers/2019internship/failure_2.py b/programmers/2019internship/failure_2.py
@@ -0,0 +1,12 @@
+def solution(N, stages):
+    result = {}
+    denominator = len(stages)
+    for stage in range(1, N+1):
+        if denominator != 0:
+            count = stages.count(stage)
+            result[stage] = count / denominator
+            denominator -= count
+        else:
+            result[stage] = 0
+    return sorted(result, key=lambda x: result[x], reverse=True)
+    
diff --git a/programmers/2019internship/key.py b/programmers/2019internship/key.py
@@ -0,0 +1,31 @@
+from itertools import combinations
+
+def solution(relation):
+    N = len(relation)
+    CN = len(relation[0])
+    if CN == 1:
+        return 1
+    unique = []
+    idxs = [i for i in range(CN)]
+    # 유일성 검증
+    for n in range(1, N+1):
+        for r in combinations(idxs, n):
+            sets = []
+            for row in relation:
+                sets.append(''.join([row[i] for i in range(CN) if i in r]))
+            sets = set(sets)
+            if len(sets) == N:
+                unique.append(r)
+    answer = []
+    unique = list(reversed(unique))
+    while unique:
+        element = unique.pop()
+        answer.append(element)
+        del_list = []
+        for other_element in unique:
+            if set(element).issubset(set(other_element)):
+                del_list.append(other_element)
+        for del_element in del_list:
+            unique.remove(del_element)
+    return len(answer)
+ 
diff --git a/programmers/2019internship/tuple_1.py b/programmers/2019internship/tuple_1.py
@@ -0,0 +1,10 @@
+def solution(s):
+    sets = [set()]
+    result = []
+    elements = s.rstrip('}').lstrip('{').split('},{')
+    for element in elements:
+        sets.append(set(element.split(',')))
+    sets.sort(key=len)
+    for i in range(len(sets)):
+        result.append(sets[i] - sets[i-1])
+    return list(map(lambda x: int(list(x)[0]), sets[1:]))
diff --git a/programmers/2019internship/tuple_2.py b/programmers/2019internship/tuple_2.py
@@ -0,0 +1,5 @@
+from collections import Counter
+def solution(s):
+  new_s = [ss.replace('{', '').replace('}', '') for ss in s.split(',')]
+  return [int(c[0]) for c in sorted(Counter,(new_s).items(), key=lambda x: x[1], reverse=True)]
+
diff --git a/programmers/2019internship/tuple_3.py b/programmers/2019internship/tuple_3.py
