leetcode88

最新推荐文章于 2024-10-06 20:16:20 发布

wenchun2021

最新推荐文章于 2024-10-06 20:16:20 发布

阅读量44

点赞数

分类专栏： Leetcode 文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/chunchun2021/article/details/132280038

版权

Leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

1.题目

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

2.思路

首先得仔细看题目，我觉得审题清楚了其实也就能写出来了

1.这两个nums都是已经sorted的了

2.nums1.size() > nums2.size

3.直接在nums1的基础上加就可以了，并且最后返回的这个nums1 也是sorted的这需要进行分别进行比较，我们才用从后往前进行遍历，分别比较最大的数，把它放到nums1的最后

3.代码

class Solution{
    public :
void merge(std::vector<int>& nums1, int m, std::vector<int>& nums2, int n) {


//首先 这两个数组 nums1 已经是sorted  并且 nums1.size() > nums2.size() 

    int i = m -1;
    int j = n -1;
    int k = m+n -1 ;  //从后面开始进行 也就是分别比较两个数组的最大的元素

    while(i >= 0 && j >= 0)
    {
        if ( nums1[i] < nums2[j])
        {
                nums1[k] = nums2[j];
                j-- ;
        }
        else
        {
            nums1[k] = nums1[i];
                i-- ;
        }
        k-- ;
    }


    //如果nums2 的还没有加完 直接加入里面
    while(j >= 0 )
    {
        nums1[k] = nums2[j];
        j -- ;
        k -- ;
    }
}
};