Leetcode455

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.

Solution:

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {

        sort( g.begin(), g.end(), greater<int>()); //加greater使之变成从大到小排序，默认是从小到大
        sort( s.begin(), s.end(), greater<int>());

        int gi = 0, si = 0;
        int res = 0;

        while ( gi < g.size() && si < s.size() ){
            if ( s[si] >= g[gi] ){
                res++;
                gi++;
                si++;
            } else
                gi++;
        }

        return res;
    }
};

总结： 这是一道典型的贪心问题，贪心问题最关键的就是确定问题是可以用贪心算法解决的，贪心算法一般都比较简单，基本都要涉及到排序。