Merge pull request #84 from zaqquum/main

Hongjoo/11월 2주차 / 2문제

Author: Mingguriguri

Hongjoo/lv1/두정수사이의합.py

@@ -0,0 +1,16 @@
+def one_to_n(n):
+    return n*(n+1) /2
+def solution(a, b):
+    '''
+    1~ 5 합 = 1+2+3+4+5 = 15 : n(n+1) /2  = 5*6/2 = 15
+    '''
+     # big , small
+    if a > b : 
+        n=a ; m=b
+    elif a < b : 
+        n=b ; m =a
+    else :  # a==b
+        return a
+    answer = one_to_n(n) - one_to_n(m-1)
+    
+    return answer

Hongjoo/lv2/최소값만들기.py

@@ -0,0 +1,15 @@
+def solution(A,B):
+    # 누적 최소값 방법 :  최소 * 최대 
+    '''
+    5+ 8+16 = 29
+    4+ 6 = 10 
+    '''
+    a= sorted(A)
+    b = sorted(B)
+    print(b)
+    answer = 0
+    for i in range(len(a)):
+        answer += a[i] * b[-1+ -1*i]
+
+
+    return answer