class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end());
int i=0;
vector<vector<int>> v;
while(i<intervals.size()){
int j=i+1;
while(intervals[i][1]>=intervals[j][0]&&j<intervals.size()){
if(intervals[i][1]>=intervals[j][1]){
j++;
}
else{
i=j;
j++;
}
}
j-=1;
v.push_back({intervals[i][0],intervals[j][1]});
i=j+1;
}
return v;
}
};
一直报越界 请问有没有人能帮忙看下