LeetCode 435 无重叠区间
题目链接:435
思路:首先将所有区间按左边界排序。然后,依次比较两个区间,当两个区间发生重叠时,为使需要移除区间的数量最小,应移除更可能与后续区间发生重叠的区间,即右边界更大的区间。实现时,可使intervals[i+1][1] = min(intervals[i][1], intervals[i+1][1]
,这样再下轮比较时,与移除了区间等价。
代码:
class Solution {
public:
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), [](vector<int>& a, vector<int>& b){
return a[0] < b[0];
});
int result = 0;
for (int i=0; i<intervals.size()-1; ++i) {
if (intervals[i][1] > intervals[i+1][0]) {
result++;
intervals[i+1][1] = min(intervals[i][1], intervals[i+1][1]);
}
}
return result;
}
};
LeetCode 763 划分字母区间
题目链接:763
方法1
思路:首先记录每个字母出现的右边界。然后遍历字符串,当找到之前遍历过的所有字母的最远边界,则该边界就是分割点。具体的,当最远边界下标等于当前下标时,说明此前的所有字母最远就到当前位置。
代码:
class Solution {
public:
vector<int> partitionLabels(string s) {
vector<int> border(26);
for (int i=0; i<s.size(); ++i) {
border[s[i]-'a'] = i;
}
int max_border = 0;
int last = -1;
vector<int> result;
for (int i=0; i<s.size(); ++i) {
max_border = max(max_border, border[s[i]-'a']);
if (max_border == i) {
result.push_back(i-last);
last = i;
}
}
return result;
}
};
方法2
思路:参考重叠区间的做法。首先记录每个字母的出现区间,然后对该区间数组进行排序。将这些区间划分成互不重叠的组,即在数组中不重叠的位置进行分割。
代码:
class Solution {
public:
vector<int> partitionLabels(string s) {
vector<vector<int>> interval(26, vector<int>(2, -1));
vector<vector<int>> interval_filter;
for (int i=0; i<s.size(); ++i) {
char c = s[i];
if (interval[c-'a'][0] == -1) interval[c-'a'][0] = i;
interval[c-'a'][1] = i;
}
for (int i=0; i<interval.size(); ++i) {
if (interval[i][0] != -1) interval_filter.push_back(interval[i]);
}
sort(interval_filter.begin(), interval_filter.end(), [](vector<int>& a, vector<int>& b){
return a[0] < b[0];
});
vector<int> result;
int last = -1;
for (int i=1; i<interval_filter.size(); ++i) {
if (interval_filter[i][0] > interval_filter[i-1][1]) {
result.push_back(interval_filter[i-1][1]-last);
last = interval_filter[i-1][1];
} else {
interval_filter[i][1] = max(interval_filter[i][1], interval_filter[i-1][1]);
}
}
result.push_back(interval_filter.back()[1]-last);
return result;
}
};
LeetCode 56 合并区间
题目链接:56
思路:与重叠区间类似,按左边界进行排序,将区间数组分割成互不重叠的组。具体的,若相邻区间重叠则合并,不重叠则分割,并记录之前的合并结果。
代码:
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), [](vector<int>& a, vector<int>& b){
return a[0] < b[0];
});
vector<vector<int>> result;
vector<int> cur = intervals[0];
for (int i=1; i<intervals.size(); ++i) {
if (intervals[i][0] <= cur[1]) {
cur[1] = max(cur[1], intervals[i][1]);
} else {
result.push_back(cur);
cur = intervals[i];
}
}
result.push_back(cur);
return result;
}
};