贪心
Douglas_LT
这个作者很懒,什么都没留下…
展开
-
非递减数列
每日一题ing,今天是个medium题665. Non-decreasing Arrayclass Solution {public: bool checkPossibility(vector<int>& nums) { int len=nums.size(),count=0; if(len<=1){ return true; } for(int i=1;i<len;i++)原创 2022-01-23 14:46:27 · 255 阅读 · 0 评论 -
贪心之区间问题(4)
每日一题ing,今天是个medium题122. Best Time to Buy and Sell Stock IIclass Solution {public: int maxProfit(vector<int>& prices) { int i = 0, profit = 0; int n=prices.size(); for(int i=1;i<n;i++) { profit=profit+max(0,prices[原创 2022-01-19 22:12:53 · 499 阅读 · 0 评论 -
贪心之区间问题(1)
每日一题ing,今天是个medium题力扣435. Non-overlapping Intervalsclass Solution {public: int candy(vector<int>& ratings) { int min=0; vector<int> mark; for(int i=0;i<ratings.size();i++) { mark.push_bac原创 2022-01-16 21:36:52 · 288 阅读 · 0 评论 -
贪心之分配问题(1)
每日一题ing,今天是个简单题力扣455. Assign Cookiesclass Solution {public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(),g.end()); sort(s.begin(),s.end()); int child=0,cookie=0; while(ch原创 2022-01-16 00:22:44 · 1659 阅读 · 0 评论