leetcode-56&88 Merge Intervals && Merge Sorted Array

第56题：Merge Intervals(区间)
Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

**注意：
区间的大小并未排序，需要首先对区间按照左边界从小到大排序！**

效率不高，时间为617ms。应该是排序比较耗时。

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */

 bool IntervalCon( const Interval& interval1, const Interval& interval2)
    {
        return (interval1.start < interval2.start);
    }

class Solution {
public:

    vector<Interval> merge(vector<Interval>& intervals) {
        if(intervals.size() == 0 || intervals.size() == 1)
        return intervals;
        vector<Interval> re;
        sort(intervals.begin(), intervals.end(), IntervalCon);//按照start从小到大排序

        vector<Interval>::iterator itr1=intervals.begin();
        struct Interval intervalTemp=*itr1;
        itr1++;
        while( itr1 != intervals.end())
        {
            if(intervalTemp.end < itr1->start)
            {
                re.push_back(intervalTemp);
                intervalTemp = *itr1;
                itr1++;
            }
            else
            {
                if(intervalTemp.end < itr1->end)
                intervalTemp.end = itr1->end;
                itr1++;
            }
        }
        re.push_back(intervalTemp);
        return re;
    }
};

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

思路简单，为了避免当数量巨大且最坏情况，决定牺牲空间换取时间，用新的向量空间作为存储结果，然后最后赋值给nums1.
运行时间4ms。
代码如下：

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int> tmp;
        int i=0 , j=0;
        while( i < m && j < n)
        {
            if(nums1[i] <= nums2[j] )
                tmp.push_back(nums1[i++]);
            else
                tmp.push_back(nums2[j++]);
        }
        if( i == m && j != n )
        for(int k = j; k < n; k++)
        {
            tmp.push_back(nums2[k]);
        }
        else if(i != m && j == n )
        {
            for(int k = i; k < m; k++)
            tmp.push_back(nums1[k]);
        }
        nums1 = tmp;
    }
};