6. 合并排序数组 II

合并两个排序的整数数组A和B变成一个新的数组。

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 m = 0, n = 0;
		for (int i = 0; i < C.length; i++) {
			if (m>A.length-1) {
				for (; n < B.length; n++) {
					C[i++] = B[n];
				}
				break;
			} else if (n>B.length-1){
				for (; m < A.length; m++) {
					C[i++] = A[m];
				}
				break;
			} else {
				if (A[m]<=B[n]) {
					C[i] = A[m];
					m++;
				} else {
					C[i] = B[n];
					n++;
				}
			}
			
		}
		return C;
    }
}