贪心算法之分发饼干（一）

解法一： 

class Solution {
public:int findContentChildren(vector<int>& g, vector<int>& s) {sort(g.begin(),g.end());sort(s.begin(),s.end());int index=s.size()-1;int res=0;for(int i=g.size()-1;i>=0;i--){if(index>=0&&s[index]>=g[i]){index--;res++;}}return res;}
};

解法二： 

class Solution {
public:int findContentChildren(vector<int>& g, vector<int>& s) {sort(g.begin(),g.end());sort(s.begin(),s.end());int child=0;int cookie=0;while (child < g.size() && cookie < s.size()) {if (s[cookie] >= g[child]) {child++;}cookie++;if (cookie >= s.size()) {break;}}return child;}
};