Add files via upload

Author: Albert-learner

Day13/CraneDrawDollMachine.py

@@ -0,0 +1,106 @@
+# 9. 크레인 인형뽑기 게임
+import numpy as np
+
+def solution(board, moves):
+    answer = 0
+
+    # 바구니 리스트
+    bucket = []
+
+    for move in moves:
+        for i in range(len(board)):
+            if board[i][move - 1] > 0:
+                bucket.append(board[i][move - 1])
+                board[i][move - 1] = 0
+
+                if bucket[-1:] == bucket[-2:-1]:
+                    answer += 2
+                    bucket = bucket[:-2]
+                break
+
+    return answer
+
+
+board_1 = [[0, 0, 0, 0, 0],
+           [0, 0, 1, 0, 3],
+           [0, 2, 5, 0, 1],
+           [4, 2, 4, 4, 2],
+           [3, 5, 1, 3, 1]]
+
+moves_1 = [1, 5, 3, 5, 1, 2, 1, 4]
+print(solution(board_1, moves_1))
+
+# 내 풀이 -> 틀림
+def solution_error(board, moves):
+    answer = 0
+
+    # 바구니 리스트
+    basket = []
+    up_down_basket = []
+
+    # Numpy의 array
+    board_lst_to_arr = np.array(board).copy()
+
+    for i in moves:
+        machine_pick_row = board_lst_to_arr[:, i - 1]
+        for j in machine_pick_row:
+            if j != 0:
+                basket.append(j)
+                machine_pick_row[np.where(machine_pick_row == j)] = 0
+
+            else:
+                continue
+
+            break
+
+    # print(basket)
+
+
+    # 첫 비교 값
+    first = 0
+
+    for i in basket:
+        first = basket.pop(0)
+        if i != first:
+            up_down_basket.append(first)
+            first = basket.pop(0)
+        elif i == first:
+            answer += 2
+            basket.pop(0)
+        elif up_down_basket[-1] == first:
+            answer += 2
+            up_down_basket.pop(-1)
+
+    return answer
+
+# print(solution_error(board_1, moves_1))
+
+def solution_best(board, moves):
+    answer = 0
+
+    return answer
+
+# print(solution_best(board_1, moves_1))
+
+def solution_other(board, moves):
+    answer = []
+
+    # 바구니 리스트
+    bucket = []
+
+    for move in moves:
+        for i in range(len(board)):
+            if board[i][move - 1] > 0:
+                bucket.append(board[i][move - 1])
+                board[i][move - 1] = 0
+
+                if bucket[-1:] == bucket[-2:-1]:
+                    answer += bucket[-1:]
+                    bucket = bucket[:-2]
+                break
+
+    return len(answer) * 2
+
+# print(solution_other(board_1, moves_1))
+
+

Day13/GuessColats.py

@@ -0,0 +1,39 @@
+# 25. 콜라츠 추측
+
+def solution(num):
+    answer = 0
+
+    while num != 1:
+        if answer < 500:
+            if num % 2 == 0:
+                num /= 2
+            else:
+                num = num * 3 + 1
+            answer += 1
+        else:
+            answer = -1
+            return answer
+    return answer
+
+num_1 = 6
+num_2 = 16
+num_3 = 626331
+
+print(solution(num_1))
+print(solution(num_2))
+print(solution(num_3))
+
+def solution_best(num):
+    answer = -1
+
+    for i in range(500):
+        num = num / 2 if num % 2 == 0 else num * 3 + 1
+
+        if num == 1:
+            answer = num + 1
+            return answer
+    return answer
+
+print(solution_best(num_1))
+print(solution_best(num_2))
+print(solution_best(num_3))

Day13/HazardNumber.py

@@ -0,0 +1,32 @@
+# 26. 햐샤드 수
+
+def solution(x):
+    answer = True
+
+    x_lst = [int(i) for i in str(x)]
+
+    if x % sum(x_lst) == 0:
+        answer = True
+    else:
+        answer = False
+    return answer
+
+x_1 = 10
+x_2 = 12
+x_3 = 11
+x_4 = 13
+
+print(solution(x_1))
+print(solution(x_2))
+print(solution(x_3))
+print(solution(x_4))
+
+def solution_best(x):
+    answer = x % sum([int(c) for c in str(x)]) == 0
+
+    return answer
+
+# print(solution_best(x_1))
+# print(solution_best(x_2))
+# print(solution_best(x_3))
+# print(solution_best(x_4))