LeetCode OJ:Merge Sorted Array

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 insert(int A[],int num,int start,int end,int m){
        if(start>=end){
            for(int i=m-1;i>=start;i--)A[i+1]=A[i];
            A[start]=num;
            return;
        }
        int mid=(start+end)/2;
        if(num<=A[mid])insert(A,num,start,mid,m);
        else insert(A,num,mid+1,end,m);
    }
    void merge(int A[], int m, int B[], int n) {
        for(int i=0;i<n;i++){
            insert(A,B[i],0,m-1,m++);
        }
    }
};

从后向前插入版

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        int ia=m-1,ib=n-1,icur=m+n-1;
        while(ia>=0&&ib>=0){
            A[icur--]=A[ia]>=B[ib]?A[ia--]:B[ib--];
        }
        while(ib>=0)A[icur--]=B[ib--];
    }
};