Merge branch 'main' of https://github.com/KNU-HAEDAL/2024-SS-small-gr…

…oup-ALSol

README.md

@@ -22,11 +22,11 @@
         <td> Python : 3&nbsp&nbsp&nbsp&nbspJava : 0&nbsp&nbsp&nbsp&nbspC : 0&nbsp&nbsp&nbsp&nbsp&nbspC++ : 0&nbsp&nbsp&nbsp&nbsp&nbspC# : 0</td>
     </tr>  <tr>
         <td> 김성원 </td>
-        <td> 54 </td>
-        <td> 54 </td>
-        <td> 46 </td>
-        <td> -46000 </td>
-        <td> Python : 54&nbsp&nbsp&nbsp&nbspJava : 0&nbsp&nbsp&nbsp&nbspC : 0&nbsp&nbsp&nbsp&nbsp&nbspC++ : 0&nbsp&nbsp&nbsp&nbsp&nbspC# : 0</td>
+        <td> 55 </td>
+        <td> 55 </td>
+        <td> 45 </td>
+        <td> -45000 </td>
+        <td> Python : 55&nbsp&nbsp&nbsp&nbspJava : 0&nbsp&nbsp&nbsp&nbspC : 0&nbsp&nbsp&nbsp&nbsp&nbspC++ : 0&nbsp&nbsp&nbsp&nbsp&nbspC# : 0</td>
     </tr>  <tr>
         <td> 김희수 </td>
         <td> 14 </td>
@@ -71,7 +71,7 @@
         <td> Python : 12&nbsp&nbsp&nbsp&nbspJava : 0&nbsp&nbsp&nbsp&nbspC : 0&nbsp&nbsp&nbsp&nbsp&nbspC++ : 0&nbsp&nbsp&nbsp&nbsp&nbspC# : 0</td>
     </tr></table>
 <br>
-총 Push 횟수 : 142회
+총 Push 횟수 : 143회
 
 # 업로드 방법
 ### 1. 파일명

SWKIM/51to60/55.py

@@ -0,0 +1,26 @@
+def solution(arr1, arr2):
+    answer = []
+    pointer1 = 0
+    pointer2 = 0
+
+    # 두 배열을 순회하면서 오름차순 정렬 실행
+    while pointer1 < len(arr1) and pointer2 < len(arr2):
+        if arr1[pointer1] < arr2[pointer2]:
+            answer.append(arr1[pointer1])
+            pointer1 += 1
+        else:
+            answer.append(arr2[pointer2])
+            pointer2 += 1
+
+    # 아직 남은 값들을 추가
+    while pointer1 < len(arr1):
+        answer.append(arr1[pointer1])
+        pointer1 += 1
+
+    while pointer2 < len(arr2):
+        answer.append(arr2[pointer2])
+        pointer2 += 1
+
+    return answer
+
+print(solution([1,2,3], [4,5,6]))

total_push_cnt.txt

@@ -1 +1 @@
-142
+143