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 (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are mand n respectively.

因为A总是足够大，所以最后的结果有n+m个element，那么merge其实就是比较大小，从后往前merge就不会有挪动位置的复杂度， 其中要注意的一个corner case就是A的index没了。。。。

class Solution {public:    void merge(int A[], int m, int B[], int n) {        int i=m-1;        int j=n-1;        int k=m+n-1;                while(j>=0){            A[k--]=i<0||A[i]<B[j]? B[j--]:A[i--];        }    }};