public class Solution {
public int[] mergeSortedArray(int[] A, int[] B) {
int i=0,j=0,k=0;
int[] arr = new int[A.length+B.length];
while(i<A.length&&j<B.length){
if(A[i]<B[j])
arr[k]= A[i++];
else
arr[k]= B[j++];
k++;
}
while(i<A.length){
arr[k]= A[i++];
k++;
}
while(j<B.length){
arr[k]= B[j++];
k++;
}
return arr;
}
}
Processed:
0.009, SQL:
9
