LeetCode 88. Merge Sorted Array

最新推荐文章于 2024-01-02 23:21:37 发布

原创最新推荐文章于 2024-01-02 23:21:37 发布 · 243 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解专栏收录该内容

288 篇文章

订阅专栏

本文详细介绍了如何使用双指针技术高效地将两个已排序的整数数组合并为一个有序数组。通过比较两个数组的当前元素并进行相应赋值操作，实现数组合并的同时保持有序性。

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.

Nothing Special. Two Pointers.

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