[LeetCode]88 Merge Sorted Array

最新推荐文章于 2024-07-21 20:23:11 发布

原创最新推荐文章于 2024-07-21 20:23:11 发布 · 280 阅读

0 ·

CC 4.0 BY-SA版权

面试题专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种高效的算法，用于将两个已排序的整数数组合并成一个有序数组。该算法利用了双指针技术，从数组末尾开始比较并放置元素，确保合并后的数组保持排序状态。适用于需要整合两个有序数组的场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

3 line Java Solution

public void merge(int A[], int m, int B[], int n) {
    int i=m-1, j=n-1, k=m+n-1;
    while (i>-1 && j>-1) A[k--]= (A[i]>B[j]) ? A[i--] : B[j--];
    while (j>-1)         A[k--]=B[j--];
}

4ms C++ solution with single loop

This code relies on the simple observation that once all of the numbers from nums2 have been merged into nums1, the rest of the numbers in nums1 that were not moved are already in the correct place.

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