[leetcode] Merge Sorted Array

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一个C++实现的算法，该算法将两个已排序的整数数组合并为一个有序数组。通过从两个数组的末尾开始比较并放置较大元素到目标数组的方法，实现了高效的合并过程。如果其中一个数组已经遍历完，则直接将另一个数组剩余部分复制到目标数组中。

From : https://leetcode.com/problems/merge-sorted-array/

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 nums1and nums2 are m and n respectively.

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