代码随想录算法训练营第三十九天
738.单调递增的数字
题目链接:738.单调递增的数字
将数字转换成字符串方便遍历,从后向前如果不符合单调递增就把前一位减一当前位变成9。最后将字符串转回数字。(一位数返回其本身)
class Solution {
public:
int monotoneIncreasingDigits(int n) {
string n_s = to_string(n);
int flag = -1;
for (int i = n_s.size() - 1; i > 0; i--) {
if (n_s[i] < n_s[i - 1]) {
n_s[i - 1]--;
flag = i;
}
}
for (int i = flag; i < n_s.size(); i++) {
n_s[i] = '9';
}
return stoi(n_s);
}
};
968.监控二叉树
题目链接:968.监控二叉树
创建状态机:有摄像头,已经被覆盖,没被覆盖
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),
* right(right) {}
* };
*/
class Solution {
public:
enum Status { No_cover = 0, cover, camera };
int result = 0;
int traversal(TreeNode* root) {
if (root == nullptr)
return cover;
int left = traversal(root->left);
int right = traversal(root->right);
if (left == No_cover || right == No_cover) {
result++;
return camera;
}
if (left == camera || right == camera)
return cover;
if (left == cover && right == cover)
return No_cover;
return -1;
}
int minCameraCover(TreeNode* root) {
if (traversal(root) == 0)
result++;
return result;
}
};
总结
找出局部最优并可以推出全局最优,就是贪心,贪心没有固定的解题模式。