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])
{
flag=i;
s[i-1]--;
}
}
for(int i=flag;i<s.size();i++)
{
s[i]='9';
}
return stoi(s);
}
};
714. 买卖股票的最佳时机含手续费 - 力扣(Leetcode)
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int result=0;
int min=prices[0];
for(int i=0;i<prices.size();i++)
{
if(prices[i]<min)
min=prices[i];
if(prices[i]>=min&&prices[i]<=fee+min)
continue;
if(prices[i]>fee+min)
{
result+=prices[i]-fee-min;
min=prices[i]-fee;
}
}
return result;
}
};
class Solution {
private:
int result;
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;
else if(left==0||right==0)
{
result++;
return 1;
}
else
return 2;
}
public:
int minCameraCover(TreeNode* root)
{
result=0;
if (traversal(root)==0)
{
result++;
}
return result;
}
};