88. Merge Sorted Array [LeetCode]

88. Merge Sorted Array

 

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]

经典的归并排序问题

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int ia = m - 1, ib = n - 1, cur = m + n - 1;
        while (ia >= 0 && ib >= 0)
            nums1[cur--] = nums1[ia] >= nums2[ib] ? nums1[ia--] : nums2[ib--];

        while (ib >= 0)
            nums1[cur--] = nums2[ib--];

    }
};