LeetCode@Array_88_MergeSortedArray

最新推荐文章于 2022-09-18 14:45:15 发布

Yanito

最新推荐文章于 2022-09-18 14:45:15 发布

阅读量294

点赞数

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

本文链接：https://blog.csdn.net/qq_33864177/article/details/72827557

版权

LeetCode 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

Problem Discription

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.

Java Programming

public class Solution
{
    public void merge(int[] nums1, int m, int[] nums2, int n)
	{
		int p1 = m - 1;
		int p2 = n - 1;
		int curr = m + n - 1;
		while (p1 > -1 && p2 > -1)
		{
			nums1[curr--] = nums1[p1] > nums2[p2] ? nums1[p1--] : nums2[p2--];
		}
		while (p2 > -1)
		{
			nums1[curr--] = nums2[p2--];
		}
	}

}