Leetcode 88 Merge Sorted Array

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

 

解题代码：

class Solution {
public:
    void merge(vector<int>& num1, int m, vector<int>& num2, int n) {
        vector<int> numTemp = num1;
        num1.clear();
        
        vector<int>::iterator it1 = numTemp.begin();
        vector<int>::iterator it2 = num2.begin();
        
        while(it2 != num2.end()  &&  it1 != numTemp.end())
        {
            if(*it1 < *it2)
            {
                num1.push_back(*it1);
                num1.push_back(*it2);
            }
            else
            {
                num1.push_back(*it2);
                num1.push_back(*it1);
            }
            
            it1++; it2++;
        }
        
        if(it1 != numTemp.end())
        {
            while(it1 != numTemp.end())
            {
                num1.push_back(*it1);
                it1++;
            }
        }
        
        if(it2 != num2.end())
        {
            while(it2 != num2.end())
            {
                num1.push_back(*it2);
                it2++;
            }
        }
    }
    
    //不能依次向 num1 插入，因为每次插入的时间复杂度较高。
};