Add files via upload

Author: SungbinYang

Day12/EvenAndOdd.py

@@ -0,0 +1,8 @@
+def solution(num):
+    if num % 2 == 0:
+        return "Even"
+    else:
+        return "Odd"
+
+print(solution(3))
+print(solution(4))

Day12/KeyPad.py

@@ -0,0 +1,65 @@
+# 내 풀이 실패
+def solution(numbers, hand):
+    answer = ''
+
+    current_left_hand_number = '*'
+    current_right_hand_number = '#'
+
+    number_map_dict = {
+        1: [0, 0],
+        2: [0, 1],
+        3: [0, 2],
+
+        4: [1, 0],
+        5: [1, 1],
+        6: [1, 2],
+
+        7: [2, 0],
+        8: [2, 1],
+        9: [2, 2],
+
+        '*': [3, 0],
+        0: [3, 1],
+        '#': [3, 2],
+    }
+
+    for current_number in numbers:
+        if current_number == 1 or current_number == 4 or current_number == 7:
+            answer += 'L'
+            current_left_hand_number = current_number
+        elif current_number == 3 or current_number == 6 or current_number == 9:
+            answer += 'R'
+            current_right_hand_number = current_number
+        else:
+            left_hand_distance = \
+                abs(number_map_dict[current_number][0] - number_map_dict[current_left_hand_number][0]) \
+                + abs(number_map_dict[current_number][1] - number_map_dict[current_left_hand_number][1])
+
+            right_hand_distance = \
+                abs(number_map_dict[current_number][0] - number_map_dict[current_right_hand_number][0]) \
+                + abs(number_map_dict[current_number][1] - number_map_dict[current_right_hand_number][1])
+
+            if left_hand_distance == right_hand_distance:
+                if hand == 'left':
+                    answer += 'L'
+                    current_left_hand_number = current_number
+                else:
+                    answer += 'R'
+                    current_right_hand_number = current_number
+            elif left_hand_distance < right_hand_distance:
+                answer += 'L'
+                current_left_hand_number = current_number
+            else:
+                answer += 'R'
+                current_right_hand_number = current_number
+    return answer
+
+
+print(solution([1, 3, 4, 5, 8, 2, 1, 4, 5, 9, 5], "right"))
+print(solution([1, 3, 4, 5, 8, 2, 1, 4, 5, 9, 5], "right") == "LRLLLRLLRRL")
+
+print(solution([7, 0, 8, 2, 8, 3, 1, 5, 7, 6, 2], "left"))
+print(solution([7, 0, 8, 2, 8, 3, 1, 5, 7, 6, 2], "left") == "LRLLRRLLLRR")
+
+print(solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 0], "right"))
+print(solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 0], "right") == "LLRLLRLLRL")

Day12/MaxAndMin.py

@@ -0,0 +1,15 @@
+def solution(n, m):
+    def gcd(x,y):
+        while(y):
+            x,y = y, x%y
+        return x
+    def lcm(x,y):
+        result = (x*y)//gcd(x,y)
+        return result
+    
+    x = gcd(n,m)
+    y = lcm(n,m)
+    return [x,y]
+
+print(solution(3, 12))
+print(solution(2, 5))

Day12/RemovedMinNumber.py

@@ -0,0 +1,12 @@
+def solution(arr):
+    del arr[arr.index(min(arr))]
+    if len(arr) == 0:
+        arr.append(-1)
+    return arr
+
+arr1 = [4,3,2,1]
+arr2 = [10]
+
+print(solution(arr1))
+
+print(solution(arr2))

Day12/SqurtTest.py

@@ -0,0 +1,9 @@
+import math
+
+def solution(n):
+    if math.sqrt(n) % 1 == 0:
+        return (math.sqrt(n)+1)**2
+    return -1
+
+print(solution(121))
+print(solution(3))