[C语言][LeetCode][88]Merge Sorted Array

题目

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.

标签

Array、Two Pointers

难度

简单

分析

题目意思是给定一个排好序的整型数组nums1、nums2，假定nums1有足够的空间存储，将nums2合并到nums1上，并且是排好序的。解题的思路是从nums1、nums2的末尾开始比较，将比较的结果放到nums1后面，从后往前放。

C代码实现

void merge(int* nums1, int m, int* nums2, int n) 
{
    while(m>0 && n>0)
    {
        if(nums1[m-1] > nums2[n-1])
        {
            nums1[m+n-1] = nums1[m-1];
            m--;
        }
        else
        {
            nums1[m+n-1] = nums2[n-1];
            n--;
        }
    }

    while(n>0)
    {
        nums1[m+n-1] = nums2[n-1];
        n--;
    }

    while(m>0)
    {
        nums1[m+n-1] = nums1[m-1];
        m--;
    }
}