Leetcode 56：Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:

Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

C++
 vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> res;
        if(intervals.size() == 0)
            return res;
        std::sort(intervals.begin(),intervals.end());
        res.push_back(intervals[0]);
        for(int i = 1;i < intervals.size();++i)
        {
            vector<int> item = res.back();
            if(intervals[i][0] > item[1])
            {
                res.push_back(intervals[i]);
            }
            else if(intervals[i][0] <= item[1]&&intervals[i][1] > item[1])
            {
                int len = res.size() - 1;
                res[len][1] = intervals[i][1];
            }
            else
                continue;
        }
        return res;
    }
    bool bigger(vector<int>& nums1,vector<int>& nums2)
    {
        return nums1[0] < nums2[0];
    }