merge two sorted array

junInUK · junInUK · commit 6279ef05f113 · 2020-09-04T23:22:32.000+01:00
diff --git a/merge_two_sorted_array/readme.md b/merge_two_sorted_array/readme.md
@@ -0,0 +1,17 @@
+6. Merge Two Sorted Arrays
+
+Merge two given sorted ascending integer array A and B into a new sorted integer array.
+
+Example
+Example 1:
+
+Input:  A=[1], B=[1]
+Output: [1,1]
+Explanation:  return array merged.
+Example 2:
+
+Input:  A=[1,2,3,4], B=[2,4,5,6]
+Output: [1,2,2,3,4,4,5,6]
+Explanation: return array merged.
+Challenge
+How can you optimize your algorithm if one array is very large and the other is very small?
diff --git a/merge_two_sorted_array/solution.java b/merge_two_sorted_array/solution.java
@@ -0,0 +1,27 @@
+public class Solution {
+    /**
+     * @param A: sorted integer array A
+     * @param B: sorted integer array B
+     * @return: A new sorted integer array
+     */
+    public int[] mergeSortedArray(int[] A, int[] B) {
+        int []C = new int[A.length + B.length];
+        int i = 0;
+        int j = 0;
+        int indexOfc = 0;
+        while( i < A.length && j < B.length){
+            C[indexOfc++] = (A[i] < B[j])?A[i++]:B[j++];
+        }
+
+        while( i < A.length){
+            C[indexOfc++] = A[i++];
+        }
+
+        while( j < B.length){
+            C[indexOfc++] = B[j++];
+        }
+
+        // write your code here
+        return C;
+    }
+}
