88. Merge Sorted Array

陈胖纸

于 2022-06-26 11:00:52 发布

阅读量126

点赞数

分类专栏： Leetcode 文章标签：算法 leetcode java

本文链接：https://blog.csdn.net/chenqiuyu10/article/details/125467902

版权

Leetcode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

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.

双指针问题，注意这里从大到小移动双指针，同时要判断指针是佛会溢出导致报错，也就是到-1了还在索引数组，这道题我的结果非常不错啦！！

Runtime: 0 ms, faster than 100.00% of Java online submissions for Merge Sorted Array.

Memory Usage: 42.8 MB, less than 47.39% of Java online submissions for Merge Sorted Array.

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