Add files via upload

Author: Albert-learner

Day8/FundamentationOfStringTreatment.py

@@ -0,0 +1,41 @@
+# 14. 문자열 다루기 기본
+
+def solution(s):
+    answer = True
+
+    if len(s) == 4 or len(s) == 6:
+        for i in s:
+            if i.isdigit():
+                answer = True
+            else:
+                answer = False
+                break
+    else:
+        answer = False
+
+
+    return answer
+
+s_1 = 'a234'
+s_2 = '1234'
+
+# print(solution(s_1))
+# print(solution(s_2))
+
+def solution_best(s):
+    answer = s.isdigit() and len(s) in (4, 6)
+
+    return answer
+
+# print(solution_best(s_1))
+# print(solution_best(s_2))
+
+import re
+
+def solution_re(s):
+    answer = bool(re.match('^(\d{4}|\d{6}$)', s))
+
+    return answer
+
+# print(solution_re(s_1))
+# print(solution_re(s_2))

Day8/SortOnMyOwnString.py

@@ -0,0 +1,33 @@
+# 16. 문자열 내 마음대로 정렬하기
+
+# 내가 풀지 못했음... 왜 어렵게 생각했을까 ㅠㅠㅠ
+def solution(strings, n):
+    answer = []
+
+    for i in range(len(strings)):
+        strings[i] = strings[i][n] + strings[i]
+
+    # print(strings)
+    strings.sort()
+    print(strings)
+
+    for i in range(len(strings)):
+        answer.append(strings[i][1:])
+    return answer
+
+strings_1 = ['sun', 'bed', 'car']
+strings_2 = ['abce', 'abcd', 'cdx']
+
+n_1 = 1
+n_2 = 2
+
+# print(solution(strings_1, n_1))
+# print(solution(strings_2, n_2))
+
+def solution_best(strings, n):
+    answer = sorted(sorted(strings), key = lambda x : x[n])
+
+    return answer
+
+print(solution_best(strings_1, n_1))
+print(solution_best(strings_2, n_2))

Day8/StringInP_And_Y_Count.py

@@ -0,0 +1,36 @@
+# 8. 문자열 내 p와 y의 개수
+
+def solution(s):
+    answer = True
+
+    # p와 y 세는 변수 선언
+    p_cnt = 0
+    y_cnt = 0
+
+    # 반복문 돌면서 개수 세기
+    for i in s:
+        if i == 'p' or i == 'p'.upper():
+            p_cnt += 1
+        elif i == 'y' or i == 'y'.upper():
+            y_cnt += 1
+        else:
+            continue
+
+    if p_cnt == y_cnt:
+        answer = True
+    else:
+        answer = False
+
+    return answer
+
+s_1 = 'pPoooyY'
+s_2 = 'Pyy'
+
+print(solution(s_1))
+print(solution(s_2))
+
+def solution_best(s):
+    return s.lower().count('p') == s.lower().count('y')
+
+print(solution_best(s_1))
+print(solution_best(s_2))