leetcode-88. Merge Sorted Array

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

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

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一个LeetCode上的经典算法题目——合并两个有序数组的方法。该题要求将两个已排序的整数数组合并成一个有序数组，并且直接在第一个数组中进行操作。通过一个简洁的C++实现展示了如何从两个数组的末尾开始比较并合并元素。

leetcode-88. 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 nums1 and nums2 are m and n respectively.

Subscribe to see which companies asked this question.

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