代码随想录算法打卡第三十一天, 新手自我记录一下刷题历程, 仅为自我打卡使用.
435. 无重叠区间
class Solution {
private:
static bool cmp(vector<int>& a, vector<int>& b) {
return a[0] < b[0];
}
public:
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
int result =0;
for (int i = 1; i < intervals.size(); ++i) {
if (intervals[i][0] < intervals[i - 1][1]) {
intervals[i][1] = min(intervals[i][1], intervals[i - 1][1]);
result++;
}
}
return result;
}
};
763. 划分字母区间
class Solution {
public:
vector<int> partitionLabels(string s) {
int hash[26];
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;
}
};
56. 合并区间
class Solution {
private:
static bool cmp(vector<int>& a, vector<int>& b) {
return a[0] < b[0];
}
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
vector<vector<int>> result;
result.push_back(intervals[0]);
for (int i = 1; i < intervals.size(); ++i) {
if (intervals[i][0] <= result.back()[1]) {
result.back()[1] = max(result.back()[1], intervals[i][1]);
} else {
result.push_back(intervals[i]);
}
}
return result;
}
};
希望能再坚持一天!