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;
vector<int> path;
if(intervals.size() == 0)return result;
sort(intervals.begin(), intervals.end(), cmp);
path = intervals[0];
for(int i = 1; i < intervals.size(); i++){
if((intervals[i][0]) <= path[1]){
path[1] = max(path[1], intervals[i][1]);
}
else{
result.push_back(path);
path = intervals[i];
}
}
result.push_back(path);
return result;
}
};
738.单调递增的数字
class Solution {
public:
int monotoneIncreasingDigits(int n) {
string numString = to_string(n);
int flag = numString.size();
for(int i = numString.size() - 1; i > 0; i--){
if(numString[i - 1] > numString[i]){
numString[i - 1]--;
flag = i;
}
}
for(int i = flag; i < numString.size(); i++){
numString[i] = '9';
}
return stoi(numString);
}
};