435. 无重叠区间
思路: 本题与弓箭射气球类似,进行区间排序,然后找出重叠空间,去掉重叠部分,即可得到所求解。
class Solution {
public:
static bool cmp (const vector<int>& a, const vector<int>& b) {
return a[0] < b[0];
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
if (intervals.size() == 0) return 0;
sort(intervals.begin(), intervals.end(), cmp);
int count = 0;
int end = intervals[0][1];
for (int i = 1; i < intervals.size(); i++) {
if (intervals[i][0] >= end) end = intervals[i][1];
else {
end = min(end, intervals[i][1]);
count++;
}
}
return count;
}
};
763.划分字母区间
思路: 统计每个字符在字符串中出现的最远位置,当移动到最远位置时,进行一次分割。
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;
}
vector<int> result;
int left=0,right=0;
for(int i=0;i<s.size();i++){
right = max(hash[s[i]-'a'],right);
if(right==i){
result.push_back(right-left+1);
left = i+1;
}
}
return result;
}
};
56. 合并区间
思路: 与前面判断重叠区间的题目相同,只不过在得到重叠区间后,将重叠区间合并,其余操作不变。
class Solution {
public:
static bool cmp(const vector<int>& a, const vector<int>& b) {
return a[0] < b[0];
}
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int>> result;
if (intervals.size() == 0)
return result;
sort(intervals.begin(), intervals.end(), cmp);
result.push_back(intervals[0]);
for (int i = 1; i < intervals.size(); i++) {
if (result.back()[1] >= intervals[i][0]) {
result.back()[1] = max(result.back()[1], intervals[i][1]);
} else {
result.push_back(intervals[i]);
}
}
return result;
}
};