lintcode刷题记录合并排序数组 java

[1,2,3,4]
[2,4,5,6]

[1,2,2,3,4,4,5,6]

[1,2,2,3,4,4,5,6]

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 []result = new int[A.length + B.length];
int length = 0;
int i = 0, j = 0;
while(length < result.length) {
if(j>=B.length || (i<A.length && A[i] < B[j])) {
result[length] = A[i++];
}else {
result[length] = B[j++];
}
length++;
}

return result;
}
}