88.merge-sorted-array.c

/*
 * @lc app=leetcode id=88 lang=c
 *
 * [88] Merge Sorted Array
 *
 * https://leetcode.com/problems/merge-sorted-array/description/
 *
 * algorithms
 * Easy (37.92%)
 * Likes:    1617
 * Dislikes: 3496
 * Total Accepted:    480.9K
 * Total Submissions: 1.3M
 * Testcase Example:  '[1,2,3,0,0,0]\n3\n[2,5,6]\n3'
 *
 * Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as
 * one sorted array.
 * 
 * Note:
 * 
 * 
 * The number of elements initialized in nums1 and nums2 are m and n
 * respectively.
 * You may assume that nums1 has enough space (size that is greater or equal to
 * m + n) to hold additional elements from nums2.
 * 
 * 
 * Example:
 * 
 * 
 * Input:
 * nums1 = [1,2,3,0,0,0], m = 3
 * nums2 = [2,5,6],       n = 3
 * 
 * Output: [1,2,2,3,5,6]
 * 
 */

// @lc code=start


void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n){
    int length = m + n;
    while(n)
    {
        if(m && nums1[m - 1] > nums2[n - 1])         /* 从后往前放，最大的放最后 */
        {
            nums1[length - 1] = nums1[m - 1];
            m--;
            length--;
        }
        else
        {
            nums1[length - 1] = nums2[n - 1];
            n--;
            length--;
        }
    }
}


// @lc code=end