Add files via upload

Author: Albert-learner

Day11/LocateIntegerDescendingOrder.py

@@ -0,0 +1,41 @@
+# 22. 정수 내림차순으로 배치하기
+
+def solution(n):
+    answer = 0
+
+    # ['1', '1', '8', '3', '7', '2'] -> [8, 7, 3, 2, 1, 1]
+    descend_lst = []
+
+    # [8, 7, 3, 2, 1, 1] -> '873211'
+    answer_str = ''
+
+    for i in str(n):
+        descend_lst.append(int(i))
+
+    descend_lst.sort(reverse = True)
+    for i in descend_lst:
+        answer_str += str(i)
+
+    answer = int(answer_str)
+    return answer
+
+n_1 = 118372
+
+print(solution(n_1))
+
+def solution_best(n):
+    answer = int(''.join(sorted(list(str(n)), reverse = True)))
+
+    return answer
+
+print(solution_best(n_1))
+
+def solution_other(n):
+    answer = 0
+
+    ls = list(str(n))
+    ls.sort(reverse=True)
+    answer = int(''.join(ls))
+    return answer
+
+print(solution_other(n_1))

Day11/MakeInArrayNaturalNumberReverse.py

@@ -0,0 +1,18 @@
+# 30. 자연수 뒤집어 배열로 만들기
+
+def solution(n):
+    answer = [int(i) for i in str(n)]
+    answer.reverse()
+
+    return answer
+
+n_1 = 12345
+
+print(solution(n_1))
+
+def solution_best(n):
+    answer = list(map(int, reversed(str(n))))
+
+    return answer
+
+print(solution_best(n_1))

Day11/MakeStrangeCharacter.py

@@ -0,0 +1,26 @@
+# 29. 이상한 문자 만들기
+
+def solution(s):
+    answer = ''
+
+    for word in s.split(' '):
+        for i, c in enumerate(word):
+            if i % 2 == 0:
+                answer += c.upper()
+            else:
+                answer += c.lower()
+        answer += ' '
+    return answer
+
+s_1 = 'try hello world'
+
+print(solution(s_1))
+
+def solution_best(s):
+    answer = ' '.join([''.join([c.upper() if i % 2 == 0 else c.lower()
+                                for i, c in enumerate(w)])
+                       for w in s.split(' ')])
+
+    return answer
+
+print(solution_best(s_1))

Day11/SumOfAliquot.py

@@ -0,0 +1,28 @@
+# 20. 약수의 합
+
+def solution(n):
+    answer = 0
+
+    # 약수 저장 리스트
+    aliquot_lst = []
+
+    for i in range(1, n + 1):
+        if n % i == 0:
+            aliquot_lst.append(i)
+
+    answer = sum(aliquot_lst)
+    return answer
+
+n_1 = 12
+n_2 = 5
+
+print(solution(n_1))
+print(solution(n_2))
+
+def solution_best(n):
+    answer = n + sum([i for i in range(1, (n // 2) + 1) if n % i == 0])
+
+    return answer
+
+print(solution_best(n_1))
+print(solution_best(n_2))

Day11/SumOfNumbers.py

@@ -0,0 +1,30 @@
+# 21. 자릿수 더하기
+
+def solution(n):
+    answer = 0
+
+    # 123 -> '123'
+    str_n = str(n)
+
+    # '123' -> [1, 2, 3]
+    n_lst = []
+
+    for i in str_n:
+        n_lst.append(int(i))
+
+    answer = sum(n_lst)
+    return answer
+
+n_1 = 123
+n_2 = 987
+
+print(solution(n_1))
+print(solution(n_2))
+
+def solution_best(n):
+    answer = sum([int(i) for i in str(n)])
+
+    return answer
+
+print(solution_best(n_1))
+print(solution_best(n_2))