88. 合并两个有序数组

链接：88. 合并两个有序数组

题解：https://leetcode-cn.com/problems/merge-sorted-array/solution/he-bing-liang-ge-you-xu-shu-zu-by-leetco-rrb0/

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int> result;
        result.reserve(nums1.size()+nums2.size());
        int i = 0;
        int j = 0;
        while(i < m && j < n) {
            if(nums1[i] < nums2[j]) {
                result.push_back(nums1[i]);
                ++i;
            } else {
                result.push_back(nums2[j]);
                ++j;
            }
        }
        while(i < m) {
            result.push_back(nums1[i]);
            ++i;
        }
        while(j < n) {
            result.push_back(nums2[j]);
            ++j;
        }
        for(int i = 0; i < m+n; ++i) {
            nums1[i] = result[i];
        }
    }
};