merge-sorted-array

Merge Sorted Array – LeetCode 88

Problem

Description

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.

Answer

Original

Code

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

思路

从尾向头进行合并，要使用逆向思维，时间复杂度$O(m+n)$，空间复杂度$O(1)$。
耗时$3$ ms，排名$56.55\%$

Better

思路

暂时还没看到更好的思路。