LintCode之6 合并排序数组

题目来源：合并排序数组
题目描述：
合并两个排序的整数数组A和B变成一个新的数组。
样例：
给出A=[1,2,3,4]，B=[2,4,5,6]，返回 [1,2,2,3,4,4,5,6]

Java代码：

public int[] mergeSortedArray(int[] A, int[] B) {
        // Write your code here
        int[] result = new int[A.length+B.length];
        int acount=0,bcount=0,rcount=0;
        while (acountlength&&bcountlength) {
            if (A[acount]<=B[bcount]) {
                result[rcount++]=A[acount];
                acount++;
                continue;
            }
            if (A[acount]>B[bcount]) {
                result[rcount++]=B[bcount];
                bcount++;
                continue;
            }
        }
        if (acount>=A.length&&bcountlength) {
            while (bcountlength) {
                result[rcount++] = B[bcount++];
            }
        }
        if (acountlength&&bcount>=B.length) {
            while (acountlength) {
                result[rcount++] = A[acount++];
            }
        }
        return result;
    }