《中英双解》leetCode Merge Sorted Array(合并两个有序数组)

@我好菜啊

于 2021-10-23 14:47:57 发布

阅读量291

点赞数 1

分类专栏： leetCode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.youkuaiyun.com/weixin_46272350/article/details/120920302

版权

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.

给你两个按非递减顺序排列的整数数组 nums1 和 nums2，另有两个整数 m 和 n ，分别表示 nums1 和 nums2 中的元素数目。

请你合并 nums2 到 nums1

最低0.47元/天解锁文章