LeetCode | 455. Assign Cookies 贪心算法水题

Assumeyou are an awesome parent and want to give your children some cookies. But, youshould give each child at most one cookie. Each child i has a greed factor g_i, which is the minimum size of a cookie that the child willbe content with; and each cookie j has a size s_j.If s_j >= g_i, we can assign the cookie j to thechild i, and the child i will be content. Your goal is to maximize the numberof your content children and output the maximum number.

Note:
You may assume the greed factor is always positive. 
You cannot assign more than one cookie to one child.

Example1:

Input: [1,2,3], [1,1]

 

Output: 1

 

Explanation: You have 3 children and 2 cookies. Thegreed factors of 3 children are 1, 2, 3.

And even though you have 2 cookies, since their size is both1, you could only make the child whose greed factor is 1 content.

You need to output 1.

Example2:

Input: [1,2], [1,2,3]

 

Output: 2

 

Explanation: You have 2 children and 3 cookies. Thegreed factors of 2 children are 1, 2.

You have 3 cookies and their sizes are big enough to gratifyall of the children,

You need to output 2.

水题，使用贪心算法解决

class Solution {

public:

    intfindContentChildren(vector<int>& g, vector<int>& s) {

     sort(g.begin(),g.end());

     sort(s.begin(),s.end());

        int t=0; int count=0;

        for(int i=0;i<g.size();i++)

        {

           while(t<s.size()&&s[t]<g[i]) t++;

            if(t==s.size()) break;

            count++;

            t++;

        }

        return count;

       

    }

};