merge-sorted-array——合并两个有序数组

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note: 
You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

归并排序

 class Solution {
 public:
     void merge(int A[], int m, int B[], int n) {
         vector<int> v(m+n,);
         int i=,j=,k=;
         while(i<m&&j<n){
             if(A[i]<B[j])
                 v[k++]=A[i++];
             else
                 v[k++]=B[j++];

         }
         while(i<m){
             v[k++]=A[i++];

         }
         while(j<n){
             v[k++]=B[j++];
         }
         for(i=;i<m+n;i++)
             A[i]=v[i];
     }
 };