Merge Two Sorted Arrays

 1 class Solution {
 2     /**
 3      * @param A and B: sorted integer array A and B.
 4      * @return: A new sorted integer array
 5      * cnblogs.com/beiyeqingteng/
 6      */
 7     public int[] mergeSortedArray(int[] A, int[] B) {
 8         int[] newArray = new int[A.length + B.length];
 9         
10         int pointer = 0;
11         
12         int pointerA = 0;
13         int pointerB = 0;
14         
15         while (pointerA < A.length && pointerB < B.length) {
16             if (A[pointerA] <= B[pointerB]) {
17                 newArray[pointer] = A[pointerA];
18                 pointerA++;
19             } else {
20                 newArray[pointer] = B[pointerB];
21                 pointerB++;
22             }
23             pointer++;
24         }
25         
26         while (pointerA < A.length) {
27             newArray[pointer] = A[pointerA];
28             pointerA++;
29             pointer++;
30         }
31         
32         while (pointerB < B.length) {
33             newArray[pointer] = B[pointerB];
34             pointerB++;
35             pointer++;
36         }
37         
38         return newArray;
39     }
40 }