第六题 Merge Two Sorted Arrays

Merge Two Sorted Arrays算法

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

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) {
        // write your code here
        int[] C = new int[A.length + B.length] ;
        int i = 0 ;
        int j = 0 ;
        int index = 0 ;
        while(i < A.length && j < B.length){
           if(A[i] < B[j]){
              C[index] = A[i] ;
              index++ ;
              i++ ;
           }else{
              C[index] = B[j] ;
              index++ ;
              j++ ;
           }
        }
        while(i < A.length){
           C[index] = A[i] ;
           index++ ;
           i++ ;
        }
        while(j < B.length){
           C[index] = B[j] ;
           index++ ;
           j++ ;
        }
        return C ;
    }
}