Q:Given two sorted integer arrays A and B, merge B into A as one sorted array.
方法:merge。Time:O(n+m) Space:O(n+m)
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int aux[]=new int[m+n];
for(int i=0;i<m;i++)aux[i]=A[i];
for(int i=0;i<n;i++)aux[m+i]=B[i];
int hi=m+n-1;
int i=0,j=m,mid=m-1;
for(int k=0;k<=hi;k++){
if(i>mid)A[k]=aux[j++];
else if(j>hi)A[k]=aux[i++];
else if(aux[i]<aux[j])A[k]=aux[i++];
else A[k]=aux[j++];
}
}
}