leetcode_97 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 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]

 

Constraints:

• -10^9 <= nums1[i], nums2[i] <= 10^9
• nums1.length == m + n
• nums2.length == n

算法解析，从两个数组的末尾开始比较，较大的填充进合并数组的末尾，循环前移

代码如下：

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int mergelen =  m + n - 1;
        int len1 = m - 1, len2 = n - 1;
        while(len1 >= 0 || len2 >= 0)
        {
            if(len1 >= 0 && len2 >= 0){
                if(nums1[len1] < nums2[len2]){
                    nums1[mergelen] = nums2[len2];
                    len2--;
                    mergelen--;
                }
                else
                {
                    nums1[mergelen] = nums1[len1];
                    len1--;
                    mergelen--;
                }
            }
            else if(len1 < 0)
            {
                if(len2 >= 0)
                {
                    nums1[mergelen] = nums2[len2];
                    len2--;
                    mergelen--;
                }
            }
            else
            {
                break;
            }
        }
    }
};