455. Assign Cookies（分蛋糕--贪心）

题目

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of 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.

Example 1:

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

Output: 1

Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. 
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.

Example 2:

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

Output: 2

Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. 
You have 3 cookies and their sizes are big enough to gratify all of the children, 
You need to output 2.

题意

给你孩子的满足因子g[i]和蛋糕的大小s[j], 只有s[j] >= g[i],孩子才会感到满足，求出最多可以满足几个孩子。

题解

C++代码

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

python代码

class Solution(object):
    def findContentChildren(self, g, s):
        """
        :type g: List[int]
        :type s: List[int]
        :rtype: int
        """
        g.sort()
        s.sort()
        res = 0
        k = 0
        for i in range(0, len(s)):
            if k < len(g) and g[k]<=s[i]: #注意条件的前后顺序,必须k<len(g)放在前面
                res = res + 1
                k = k + 1

        return res