56. Merge Intervals(合并区间)
class Solution {
public:
//定义排序函数
static bool cmp(vector<int> &a,vector<int> &b){
if(a[0]==b[0])
return a[1]<b[1];
return a[0]<b[0];
}
vector<vector<int>> merge(vector<vector<int>>& ints) {
vector<vector<int> > res;
if(ints.empty()){
return res;
}