力扣 56.合并区间

示例：
输入：intervals = [ [1, 3], [2, 6], [8, 10], [15, 18] ]
输出：[ [1, 6], [8, 10], [15, 18] ]

示例：
输入：intervals = [ [1, 4], [4 ,5] ]
输出：[ [1, 5] ]

思路：
1、先把左边界进行一个排序
2、然后两两进行一个合并

#pragma once
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>


using namespace std;

class Solution
{
public:
	Solution();
	~Solution();
	static bool cmp(const vector<int>& a, const vector<int>& b);

	vector< vector<int>> merge(vector< vector<int>>& intervals);


private:

};



#include "Solution.h"

Solution::Solution()
{
}

Solution::~Solution()
{
}

bool Solution::cmp(const vector<int>& a, const vector<int>& b)
{
	return a[0] < b[0];
}

vector< vector<int>> Solution::merge(vector< vector<int>>& intervals)
{
	vector < vector <int >> vecResult;
	if (0 == intervals.size())
	{
		return intervals;
	}

	sort(intervals.begin(), intervals.end(), cmp);

	bool bFlag = false;

	int iLength = intervals.size();

	for (size_t i = 1; i < iLength; i++)
	{
		int istart = intervals[i - 1][0];
		int iend = intervals[i - 1][1];

		while (i < iLength && intervals[i][0] <= iend)
		{
			iend = max(iend, intervals[i][1]);
			if (i == iLength - 1)
			{
				bFlag = true;
			}
			i++;
		}
		vecResult.push_back({istart, iend});
	}

	if (!bFlag)
	{
		vecResult.push_back({intervals[iLength - 1][0], intervals[iLength - 1][1]});
	}

	return vecResult;
}