Add files via upload

Author: Albert-learner

Day12/DiscriminateIntegerSquareRoot.py

@@ -0,0 +1,31 @@
+# 32. 정수 제곱근 판별
+
+def solution(n):
+    answer = 0
+
+    n_root = n ** 0.5
+    if int(n_root) == n_root:
+        answer = int((n_root + 1) ** 2)
+    else:
+        answer = -1
+    return answer
+
+n_1 = 121
+n_2 = 3
+
+print(solution(n_1))
+print(solution(n_2))
+
+import math
+
+def solution_best(n):
+    answer = 0
+
+    if math.sqrt(n).is_integer():
+        answer = int(pow(math.sqrt(n) + 1, 2))
+    else:
+        answer = -1
+    return answer
+
+# print(solution_best(n_1))
+# print(solution_best(n_2))

Day12/GCDandLCM.py

@@ -0,0 +1,38 @@
+# 34. 최대공약수와 최소공배수
+
+# 좀만 더 생각하지...
+def solution(n, m):
+    answer = []
+
+    a, b = max(n, m), min(n, m)
+    t = 1
+    while t > 0:
+        t = a % b
+        a, b = b, t
+    answer = [a, int(n * m / a)]
+    return answer
+
+n_1 = 3
+n_2 = 2
+
+m_1 = 12
+m_2 = 5
+
+print(solution(n_1, m_1))
+print(solution(n_2, m_2))
+
+from math import gcd
+
+def solution_best(n, m):
+    answer = []
+
+    GCD = gcd(n, m)
+    LCM = n * m // GCD
+
+    answer.append(GCD)
+    answer.append(LCM)
+
+    return answer
+
+print(solution_best(n_1, m_1))
+print(solution_best(n_2, m_2))

Day12/OddOrEven.py

@@ -0,0 +1,24 @@
+# 33. 짝수와 홀수
+
+def solution(num):
+    answer = ''
+
+    if num % 2 == 0:
+        answer += 'Even'
+    else:
+        answer += 'Odd'
+    return answer
+
+num_1 = 3
+num_2 = 4
+
+print(solution(num_1))
+print(solution(num_2))
+
+def solution_best(num):
+    answer = 'Even' if num % 2 == 0 else 'Odd'
+
+    return answer
+
+print(solution_best(num_1))
+print(solution_best(num_2))

Day12/PressKeypad.py

@@ -0,0 +1,48 @@
+# 24. 키패드 누르기
+
+# 내가 못 품 ... 2, 5, 8, 0일때 생각
+def solution(numbers, hand):
+    answer = ''
+    lastL = 10
+    lastR = 12
+
+    for number in numbers:
+        if number in [1, 4, 7]:
+            answer += 'L'
+            lastL = number
+        elif number in [3, 6, 9]:
+            answer += 'R'
+            lastR = number
+        else:
+            number = 11 if number == 0 else number
+
+            absL = abs(number - lastL)
+            absR = abs(number - lastR)
+
+            if sum(divmod(absL, 3)) > sum(divmod(absR, 3)):
+                answer += 'R'
+                lastR = number
+            elif sum(divmod(absL, 3)) < sum(divmod(absR, 3)):
+                answer += 'L'
+                lastL = number
+            else:
+                if hand == 'left':
+                    answer += 'L'
+                    lastL = number
+                else:
+                    answer += 'R'
+                    lastR = number
+
+    return answer
+
+numbers_1 = [1, 3, 4, 5, 8, 2, 1, 4, 5, 9, 5]
+numbers_2 = [7, 0, 8, 2, 8, 3, 1, 5, 7, 6, 2]
+numbers_3 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]
+
+hand_1 = 'right'
+hand_2 = 'left'
+hand_3 = 'right'
+
+print(solution(numbers_1, hand_1))
+print(solution(numbers_2, hand_2))
+print(solution(numbers_3, hand_3))

Day12/RemoveSmallestNumber.py

@@ -0,0 +1,30 @@
+# 23. 제일 작은 수 제거하기
+
+def solution(arr):
+    answer = []
+
+    if len(arr) == 1:
+        answer = [-1]
+    else:
+        min_cost = min(arr)
+        for i in arr:
+            if i == min_cost:
+                arr.remove(i)
+
+        for i in arr:
+            answer.append(i)
+    return answer
+
+arr_1 = [4, 3, 2, 1]
+arr_2 = [10]
+
+# print(solution(arr_1))
+# print(solution(arr_2))
+
+def solution_best(arr):
+    answer = [i for i in arr if i > min(arr)]
+
+    return answer
+
+print(solution_best(arr_1))
+print(solution_best(arr_2))