LeetCode 88. Merge Sorted Array

最新推荐文章于 2024-10-09 16:35:51 发布

原创最新推荐文章于 2024-10-09 16:35:51 发布 · 107 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本文介绍了一种算法，用于将两个已排序的整数数组合并成一个有序数组。通过比较两个数组的末尾元素，将较大的元素逆序放入目标数组，直至两个数组全部处理完毕。示例：输入数组为nums1=[1,2,3,0,0,0]，m=3；nums2=[2,5,6]，n=3；输出为[1,2,2,3,5,6]。

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]

先比较两个有序数组的末元素，然后将较大的推到nums1数组中，依次由尾至前排数。循环直到两个数组都为空。

class Solution {
    public void merge(int[] A, int m, int[] B, int n) {
        int i=m-1;
	    int j=n-1;
	    int k = m+n-1;
	    while(i >=0 && j>=0){
	        if(A[i] > B[j])
	            A[k--] = A[i--];
	        else
		    A[k--] = B[j--];
	    }
	    while(j>=0)
	        A[k--] = B[j--];
    }
}