双指针 归并两个有序数组 88. Merge Sorted Array

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
Merge nums1 and nums2 into a single array sorted in non-decreasing order.
The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
Example 1:
Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Explanation: The arrays we are merging are [1,2,3] and [2,5,6].
The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.
Example 2:
Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]
Explanation: The arrays we are merging are [1] and [].
The result of the merge is [1].
Example 3:
Input: nums1 = [0], m = 0, nums2 = [1], n = 1
Output: [1]
Explanation: The arrays we are merging are [] and [1].
The result of the merge is [1].
Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.
Constraints:
nums1.length == m + n
nums2.length == n
0 <= m, n <= 200
1 <= m + n <= 200
-109 <= nums1[i], nums2[j] <= 109
Follow up: Can you come up with an algorithm that runs in O(m + n) time?

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

但这样写是Onm^2啊，怎么写成Om+n
想到了，先把nums1中的元素全移到右边，然后nums1和2挨个取小的往里放，最后如果nums2还剩就放到最后。时间复杂度Om+n

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

答案是从后往前插入较大的，不用一开始全右移了。