Merge Sorted Array

从后往前merge 数组A和B

class Solution {public:    void merge(int A[], int m, int B[], int n) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int x=m-1,y=n-1;        for(int i=m+n-1;i>=0;--i){            if(x>=0&&y>=0){                if(A[x]>B[y]){                    A[i]=A[x--];                }else{                    A[i]=B[y--];                }            }else if(x>=0){                A[i]=A[x--];            }else{                A[i]=B[y--];            }        }    }};