[LeetCode] 88. Merge Sorted Array

[LeetCode] 88. 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.

---

从大到小比较，i是nums1最大的下标，j是nums2最大的下标，最大的放在nums1的最后的位置，重复此步骤。。。

---

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