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 nums1and nums2 are m and n respectively.
void merge(int* nums1, int m, int* nums2, int n)
{
int ptr1 = m-1;
int ptr2 = n-1;
/* 按从大到小的顺序比较插入 */
int insert_ptr = m + n - 1;
while (ptr1 >= 0 && ptr2 >= 0)
{
nums1[insert_ptr--] = (nums1[ptr1] < nums2[ptr2]) ? nums2[ptr2] : nums1[ptr1];
(nums1[ptr1] < nums2[ptr2]) ? (ptr2--) : (ptr1--);
}
if (ptr1 < 0 && ptr2 >= 0)
{
while((ptr2) >= 0)
{
nums1[insert_ptr--] = nums2[ptr2];
ptr2--;
}
}
if (ptr2 < 0 && ptr1 >= 0)
{
while ((ptr1) >= 0)
{
nums1[insert_ptr--] = nums1[ptr1];
ptr1--;
}
}
}