Today's Date: 02-18-2026

ProblemName : 0088-merge-sorted-array 

- Difficulty: Easy , time: 6 ms (3.8%), space: 44 MB (25.88%)

Author: chech2

0088-merge-sorted-array/0088-merge-sorted-array-02-18-2026-20-00-16.java

@@ -0,0 +1,23 @@
+import java.util.*;
+
+class Solution {
+
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        
+        if(n != 0) {
+            if(m == 0){
+                for(int i = 0; i < n; i++){
+                    nums1[i] = nums2[i];
+                }
+            } else {
+                int i = m;
+                for(int j = 0; j < n; j++, i++){
+                    nums1[i] = nums2[j];
+                }
+            }
+        }
+
+        Arrays.sort(nums1);
+        System.out.println(Arrays.toString(nums1));
+    }
+}