Problem

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2.

Constraints:

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

Example1

Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]

Example2

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]

Solution

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        
        int i = m - 1;
        int j = n - 1;
        int k = m + n - 1;

        while(i >= 0 || j >= 0)
        {
            if(i >= 0 && j >= 0)
            {
                if(nums1[i] > nums2[j])
                {
                    nums1[k] = nums1[i];
                    --i;
                }
                else
                {
                    nums1[k] = nums2[j];
                    --j;
                }
            }
            else if(i >= 0)
            {
                nums1[k] = nums1[i];
                    --i;
            }
            else
            {
                nums1[k] = nums2[j];
                    --j;
            }
            --k;
        }

    }
};

标签：2021.04,05,int,else,Merge,Output,--,nums1,nums2
来源： https://blog.csdn.net/sjt091110317/article/details/115437773