代码随想录day31 56. 合并区间 738.单调递增的数字
56. 合并区间
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),[](const vector<int> &lhs,const vector<int> &rhs){
return lhs[0] != rhs[0] ? lhs[0] < rhs[0] : lhs[1] > rhs[1];
});
int left = intervals[0][0];
int right = intervals[0][1];
vector<vector<int>> res;
for (int i = 1; i < intervals.size(); i++) {
if (intervals[i][0] > right) {
res.push_back({left,right});
left = intervals[i][0];
right = intervals[i][1];
continue;
}
right = max(intervals[i][1], right);
}
res.push_back({left,right});
return res;
}
};
代码随想录
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int>> result;
if (intervals.size() == 0) return result; // 区间集合为空直接返回
// 排序的参数使用了lambda表达式
sort(intervals.begin(), intervals.end(), [](const vector<int>& a, const vector<int>& b){return a[0] < b[0];});
// 第一个区间就可以放进结果集里,后面如果重叠,在result上直接合并
result.push_back(intervals[0]);
for (int i = 1; i < intervals.size(); i++) {
if (result.back()[1] >= intervals[i][0]) { // 发现重叠区间
// 合并区间,只更新右边界就好,因为result.back()的左边界一定是最小值,因为我们按照左边界排序的
result.back()[1] = max(result.back()[1], intervals[i][1]);
} else {
result.push_back(intervals[i]); // 区间不重叠
}
}
return result;
}
};
738.单调递增的数字
class Solution {
public:
int monotoneIncreasingDigits(int n) {
string str = to_string(n);
int flag = str.size();
for (int i = str.size() - 1; i >= 1; i--) {
if (str[i - 1] > str[i]) {
str[i - 1]--;
flag = i;
}
}
for (int i = flag; i < str.size(); i++) {
str[i] = '9';
}
return stoi(str);
}
};