PU 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.

C Solution:

void merge(int* nums1, int m, int* nums2, int n) {
    int k = m + n - 1, i, j;
    for (i = m - 1, j = n - 1; i > -1 && j > -1; ) {
        nums1[k--] = nums1[i] > nums2[j] ? nums1[i--] : nums2[j--];
    }
    if (i == -1) memcpy(nums1, nums2, (j + 1) * sizeof(int));
}

Summary:

• funny

LeetCode: 88. Merge Sorted Array