-
今日学习的文章链接,或者视频链接
-
自己看到题目的第一想法
-
看完代码随想录之后的想法
435:
按照左区见排序:
class Solution {
public:
static bool cmp(vector<int>a,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;
for(int i =1;i<intervals.size();i++){
if(intervals[i][0]<intervals[i-1][1]){
count++;
intervals[i][1]=min(intervals[i][1],intervals[i-1][1]);
}
}
return count;
}
};
按照右区间排序:
class Solution {
public:
static bool cmp(vector<int>a,vector<int>b){
return a[1]<b[1];
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
if(intervals.size()==0) return 0;
sort(intervals.begin(),intervals.end(),cmp);
int count = 1;
int x_end = intervals[0][1];
for(int i =0;i<intervals.size();i++){
int x_cur = intervals[i][0];
if(x_cur >= x_end){
count++;
x_end = intervals[i][1];
}
}
return intervals.size()-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(right,hash[s[i]-'a']);
if(i==right){
result.push_back(right-left+1);
left = i+1;
}
}
return result;
}
};
56
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) {
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(intervals[i][0]<=result.back()[1]){
//重叠,需要合并
result.back()[1] = max(intervals[i][1],result.back()[1]);
}
else{
result.push_back(intervals[i]);
}
}
return result;
}
};
-
自己实现过程中遇到哪些困难
-
今日收获,记录一下自己的学习时长