[leetCode]Merge Sorted Array

并归排序的思想，新get一种地址取法~之前怎么想不到。。

#include <iostream>
#include <string.h>
using namespace std;

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        if(n == 0) return ;
        if(m == 0){
            memcpy(A,B,sizeof(int)*n);
            return ;
        }
        int *num = new int[m+n];
        memset(num,0,m+n);
        int im,in,index;
        im = in = index =0;
        while(index<m+n){
            num[index++] = (A[im] <= B[in])?(A[im++]):(B[in++]);
            if(in == n || im == m) break;
        }
        if(in == n) memcpy(&num[index],&A[im],sizeof(int)*(m-im));//new skill gets!
        else memcpy(&num[index],&B[in],sizeof(int)*(n-in));
        memcpy(A,num,sizeof(int)*(m+n));
        delete []num;
    }
};