Merge pull request #20 from zaqquum/main

Hongjoo /4월 2주차 /4문제

Author: Mingguriguri

Hongjoo/lv1/두개뽑아서더하기.py

@@ -0,0 +1,12 @@
+def solution(numbers):
+    answer = []
+    #pick 2 elements and sum
+    for i in range(len(numbers)) : 
+        for k in range(i+1,len(numbers)):
+            answer.append(numbers[i]+numbers[k])
+    print(answer)
+    #delete duple elements
+    answer=list(set(answer))
+    answer.sort()
+    print(answer)
+    return answer

Hongjoo/lv2/JadenCase문자열만들기.py

@@ -0,0 +1,28 @@
+def solution(s):
+    #1. words(" ") 
+    # first letter : Big 
+    # others : small
+    #연속 띄어쓰기 :가능
+    answer = []
+    small = s.lower()
+    s_li = list(small)
+    for i in range(len(s_li)):
+        #upper
+        #1.first letter
+        if i == 0 : 
+            s_li[i]=s_li[i].upper()
+        #2. word's first letter 
+        if s_li[i] == " ":
+            if s_li[i+1].islower():
+                s_li[i+1] = s_li[i+1].upper()
+        #number issue : " " +number + str 
+        if s_li[i].isnumeric() and i!=0 :
+            if s_li[i+1].isnumeric():
+                continue
+            if s_li[i+1]== " "and s_li[i+2].isalpha():
+                del s_li[i+1]
+            if s_li[i-1] != " " :
+                s_li.insert(i," ")
+    answer="".join(s_li)
+    print(answer)
+    return answer

Hongjoo/lv2/뒤에있는큰수찾기.py

@@ -0,0 +1,12 @@
+def solution(numbers):
+    answer = []
+    for i in range(len(numbers)):
+        for k in range(i,len(numbers)): 
+        # 1. n[i] < m 
+            if numbers[i] < numbers[k]:
+                answer.append(numbers[k])
+                break
+         # 2. nothing -> m= -1
+            if k == len(numbers)-1: 
+                answer.append(-1)
+    return answer

Hongjoo/lv2/숫자블록.py

@@ -0,0 +1,21 @@
+def solution(begin, end):
+    #1. make map
+    # list, range()로 dict 만들기
+    # 지정된 value = 0 으로 원하는 size의 dict 만들기
+    values = []
+    for k in range(begin,end+1):
+        values.append(0)
+    dic=dict(zip(range(begin,end+1),values))
+    print(dic, type(dic))
+    #n in 2n, 3n 4n
+    n=1 
+    while 2*n <= end :
+        m=2
+        while n*m <= end:
+            dic[n*m]= n 
+            m+= 1
+
+        n+= 1
+    answer=list(dic.values())
+    print(answer)
+    return answer