[Leetcode] 88.Merge Sorted Array

[leetcode] 88. Merge Sorted Array

题目链接：https://leetcode.com/problems/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 andnums2 are m and n respectively.

思路

从右端开始赋值，每次取其中一个值并将其位置左移一位。时间复杂度为O(m + n)。

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