描述
合并两个排序的整数数组A和B变成一个新的数组
样例
给出A=[1,2,3,4],B=[2,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 m = A.length;
int n = B.length;
int[] C = null;
int i=0,j=0,k=0;
while(i< m && j<n)
{
if(A[i] <= B[j])
C[k++] = A[i++];
else
C[k++] = B[j++];
}
while(i<m)
C[k++] = A[i++];
while(j<n)
C[k++] = B[j++];
return C;
}
}