class Solution {
public:
static bool cmp(vector<int>&a,vector<int>&b)
{
return a[1]<b[1];
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),cmp);
int end=intervals[0][1];
int count=1;
for(int i=1;i<intervals.size();i++)
{
if(end<=intervals[i][0])
{
end=intervals[i][1];
count++;
}
}
return intervals.size()-count;
}
};
class Solution {
public:
vector<int> partitionLabels(string s) {
int hash[27]={0};
for(int i=0;i<s.size();i++)
{
hash[s[i]-'a']=i;
}
int left=0;
int right=0;
vector<int>result;
for(int i=0;i<s.size();i++)
{
right=max(right,hash[s[i]-'a']);
if(i==right)
{
result.push_back(right-left+1);
left=i+1;
}
}
return result;
}
};
class Solution {
public:
static bool cmp(vector<int>& a,vector<int>& b)
{
return a[0]<b[0];
}
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),cmp);
vector<vector<int>>results;
bool flag=false;
for(int i=1;i<intervals.size();i++)
{
int left=intervals[i-1][0];
int right=intervals[i-1][1];
while(i<intervals.size()&&intervals[i][0]<=right)
{
right=max(right,intervals[i][1]);
if(i==intervals.size()-1)
flag=true;
i++;
}
results.push_back({left,right});
}
if(flag==false)
results.push_back({intervals[intervals.size()-1][0],intervals[intervals.size()-1][1]});
return results;
}
};