leetcode-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.

要完成的函數：

int findContentChildren(vector<int>& g, vector<int>& s)

 

說明：

一、這道題目看清題意就不難了。每一個孩子有個需求尺寸數，是整數，一、二、3這樣子的。有幾塊餅乾，尺寸是整數，一、二、3這樣子的。不能把餅乾掰開給。

要求輸出可以知足幾個孩子的需求。

二、首先對需求尺寸數g進行排序，對餅乾尺寸數s進行排序，而後從g和s的第一位開始比較，直到g或者s處理完了。

代碼也很簡單，以下：

    int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(),g.end()); sort(s.begin(),s.end()); int i=0,j=0; while(i<g.size()&&j<s.size())//處理完全部孩子的需求或者已經沒有知足需求的餅乾了
 { if(s[j]>=g[i]) i++; //若是知足了處理下一個i
            j++;//若是不知足j一直加
 } return i; }

上述代碼實測40ms，beats 97.41% of cpp submissions。