Leetcode 88. Merge Sorted Array

原题：

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

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

解决方法：
由于是在nums1的基础上合并，所以从后往前进行合并。

代码：

void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int i = m - 1, j = n - 1, k = m+n-1;
        while(i>=0 || j >= 0){
            if (i < 0){
                nums1[k--] = nums2[j--];
            }else if (j < 0){
                nums1[k--] = nums1[i--];
            }else if (nums1[i] <= nums2[j]){
                nums1[k--] = nums2[j--];
            }else{
                nums1[k--] = nums1[i--];
            }
        }
    }