Merge Sorted Array

12.25 2014

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 m and nrespectively.

class Solution {public:    void merge(int A[], int m, int B[], int n) {        int i=m-1,j=n-1;        int index=m+n-1;        for(;i>=0&&j>=0;index--){            if(A[i]>=B[j]){                A[index]=A[i];                i--;            }            else{                A[index]=B[j];                j--;            }        }        while(j>=0){            A[index]=B[j];            j--;            index--;        }    }};

思路：

可以从后面开始考虑，既然有足够的空间。