文章目录
738.单调递增的数字
https://leetcode.cn/problems/monotone-increasing-digits/
class Solution {
public:
int monotoneIncreasingDigits(int n) {
string s = to_string(n);
int flag = s.size();
for(int i = s.size() - 1; i > 0; i--){
if(s[i - 1] > s[i]){
s[i - 1]--;
flag = i;
}
}
for(int i = flag; i < s.size(); i++){
s[i] = '9';
}
return stoi(s);
}
};
968.监控二叉树
https://leetcode.cn/problems/binary-tree-cameras/
从下往上看,局部最优:让叶子节点的父节点安摄像头,所用摄像头最少,整体最优:全部摄像头数量所用最少!
大体思路就是从低到上,先给叶子节点父节点放个摄像头,然后隔两个节点放一个摄像头,直至到二叉树头结点。
三种情况:
- 0:该节点无覆盖
- 1:本节点有摄像头
- 2:本节点有覆盖
class Solution {
public:
int res;
int traversal(TreeNode* cur){
if(cur == NULL) return 2;
int left = traversal(cur->left);
int right = traversal(cur->right);
if(left == 2 && right == 2) return 0;
if(left == 0 || right == 0){
res++;
return 1;
}
if(left == 1 || right == 1) return 2;
return -1;
}
int minCameraCover(TreeNode* root) {
if(traversal(root) == 0) res++;
return res;
}
};