Merge Two Sorted Arrays

Merge two given sorted integer array A and B into a new sorted integer array.

Example

A=[1,2,3,4]

B=[2,4,5,6]

return [1,2,2,3,4,4,5,6]

 class Solution {
     /**
      * @param A and B: sorted integer array A and B.
      * @return: A new sorted integer array
      * cnblogs.com/beiyeqingteng/
      */
     public int[] mergeSortedArray(int[] A, int[] B) {
         int[] newArray = new int[A.length + B.length];

         int pointer = ;

         int pointerA = ;
         int pointerB = ;

         while (pointerA < A.length || pointerB < B.length) {
             if (pointerB == B.length || pointerA < A.length && A[pointerA] <= B[pointerB]) {
                 newArray[pointer] = A[pointerA];
                 pointerA++;
             } else {
                 newArray[pointer] = B[pointerB];
                 pointerB++;
             }
             pointer++;
         }

         return newArray;
     }
 }

转载请注明出处：cnblogs.com/beiyeqingteng/