Leetcode之 Merge Sorted Array

合并两个有序数组的算法思路

最新推荐文章于 2024-01-18 17:58:46 发布

一只荣

最新推荐文章于 2024-01-18 17:58:46 发布

阅读量93

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode和机试题文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/qq_35455503/article/details/89917425

leetcode和机试题专栏收录该内容

509 篇文章

订阅专栏

博客围绕合并两个有序整数数组展开，给定已排序的数组nums1和nums2，需将nums2合并到nums1中成为一个有序数组，nums1有足够空间容纳nums2元素，还给出从后往前填的解题思路。

题目：

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively.
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

代码：

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

思路：

从后往前填