Merge pull request #16 from zaqquum/main

hongjoo / 4월 1주차 / 4문제

Author: zaqquum

Hongjoo/lv1/둘만의암호.py

@@ -0,0 +1,15 @@
+def solution(s, skip, index):
+    li =["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
+    sub_li = list(skip)
+    # 1.res_li = li - list(skip) // Difference 
+    res_li = [x for x in li if x not in sub_li]
+    input = list(s)
+    answer = ''
+    #2. find matching element's index(k) and add "index"
+    # if the adding index is out of range ,using mod
+    for i in range(len(input)):
+        for k in range(len(res_li)):
+            if input[i] == res_li[k]:
+                answer += res_li[(k+index)%len(res_li)]
+                break
+    return answer

Hongjoo/lv1/평균구하기.py

@@ -0,0 +1,9 @@
+def solution(arr):
+    answer = 0
+
+    for n in arr : 
+        answer += n
+    
+    answer = answer/len(arr)
+    print(answer)
+    return answer

Hongjoo/lv1/푸드파이트대회.py

@@ -0,0 +1,16 @@
+def solution(food):
+    answer = ''
+    # 1. find sub that is one person will eat order 
+    sub = ""
+    re_sub = ""
+    count =0
+    for i in range(1, len(food)):
+        count = food[i]//2
+        for j in range(count):
+            sub+=str(i)
+    for k in sub[::-1]:
+        re_sub += k
+    
+    answer = sub + "0" + re_sub
+        
+    return answer

Hongjoo/lv2/행렬의곱.py

@@ -0,0 +1,17 @@
+def solution(arr1, arr2):
+    answer = [[]]
+    s_li = []
+    s1=0
+    for r1 in range(len(arr1)):
+        for c2 in range(len(arr2[0])):
+            for c1 in range(len(arr1[r1])):
+                r2 = c1
+                x = arr1[r1][c1]*arr2[r2][c2]
+                s1+=x
+            s_li.append(s1)
+            s1 = 0
+        answer.append(s_li)
+        s_li=[]
+    del answer[0]
+
+    return answer