Merge Sorted Array

题目：

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

分析：从后面向前分析，本题思考一下，nums1到最前面，nums2没有结束的情况

代码：

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int k=m+n-1;
        int n1=m-1;
        int n2=n-1;
        if(n1<0)
        {
            for(int i=0; i<n; i++)
            {
                nums1[i]=nums2[i];
            }
        }
        while(n1>=0&&n2>=0)
        {
            
            if(nums1[n1]>nums2[n2])
            {
                nums1[k--]=nums1[n1];
                n1--;
            }
            else
            {
                nums1[k--]=nums2[n2];
                n2--;
            }
            
        }
        if(n2>=0)
        {
            while(k>=0)
            {
                nums1[k]=nums2[n2];
                n2--;
                k--;
            }
        }
        
        
    }
};