day31|LeetCode:● 455.分发饼干 ● 376. 摆动序列 ● 53. 最大子序和
题目链接:455.分发饼干代码classSolution{public:intfindContentChildren(vector&g,vector&s){sort(g.begin(),g.end());sort(s.begin(),s.end());intsize=0;intt=0;for(inti=0;i&nums){if(nums.size()==1){return1;}intcount=0