● 435. 无重叠区间
● 763.划分字母区间
● 56. 合并区间
435. 无重叠区间
感觉和昨天的气球很像,但是又有点不一样
按照右边界从小到大排序,
找出不重叠的区域,然后用总数减去重叠的区域即可
每次更新新的右边界,代码比较容易
class Solution {
public:
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), [&](const vector<int>& a, const vector<int>& b){
return a[1] < b[1];
});
int non = 1;
int end = intervals[0][1];
for(int i = 1; i < intervals.size(); ++i) {
if(intervals[i][0] >= end) {
non++;
end = intervals[i][1];
}
}
return intervals.size() - non;
}
};
763. 划分字母区间
不难,但是就是写不出呜呜呜
class Solution {
public:
vector<int> partitionLabels(string s) {
int hash[26] {};
for(int i = 0; i < s.length(); ++i) {
hash[s[i] - 'a'] = i;
}
vector<int> res;
int l = 0, r = 0;
for(int i = 0; i < s.size(); ++i) {
r = max(r, hash[s[i] - 'a']);
if(i == r) {
res.push_back(r - l + 1);
l = i + 1;
}
}
return res;
}
};
56. 合并区间
熟悉的感觉
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int>> res;
sort(intervals.begin(), intervals.end(), [&](const vector<int>& a, const vector<int>& b){
return a[0] < b[0];
});
res.push_back(intervals[0]);
for(int i = 1; i < intervals.size(); ++i) {
if(res.back()[1] >= intervals[i][0]) {
res.back()[1] = max(res.back()[1], intervals[i][1]);
} else {
res.push_back(intervals[i]);
}
}
return res;
}
};