LintCode之6 合并排序数组

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 (acount<A.length&&bcount<B.length) {
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&&bcount<B.length) {
while (bcount<B.length) {
result[rcount++] = B[bcount++];
}
}
if (acount<A.length&&bcount>=B.length) {
while (acount<A.length) {
result[rcount++] = A[acount++];
}
}
return result;
}