面试题 10.01. 合并排序的数组
思路:①把B数组放在A数组后面,然后排序。O((n+m)²),太蠢了代码不写
②copyA数组,然后两个指针判度copyA,和B的值那个小,小的放在A数组中,然后把剩下的数放进去
class Solution {
public:
void merge(vector<int>& A, int m, vector<int>& B, int n) {
vector<int> A_back(A.begin(), A.begin()+m);
int i=0, j=0, k=0;
while(i<m && j<n){
if(A_back[i]>B[j]){
A[k++] = B[j++];
}
else{
A[k++] = A_back[i++];
}
}
while(i<m) A[k++] = A_back[i++];
while(j<n) A[k++] = B[j++];
}
};