[C#][LeetCode][Easy] 455. Assign Cookies

心得

題目詢問說共可以滿足幾個小孩所期望的蛋糕數,例如總共有三個小孩A, B, C,A希望獲得1片蛋糕;B希望獲得2片蛋糕;C希望獲得3片蛋糕,而總共有兩塊蛋糕Z, X,Z可以切成1片,X可以切成兩片,這樣的話答案是2,因為最多只能滿足兩個小孩的需求。依照這個思路去撰寫Code就容易得多了。

問題

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:

1
2
3
4
5
6
7
8
9
10
11
12
13
14

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:

1
2
3
4
5
6
7
8
9
10
11
12
13
14

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

答案

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

public class Solution {
public int FindContentChildren(int[] g, int[] s) {
Array.Sort(g);
Array.Sort(s);

int ans = 0;

for (int i = 0; ans < g.Length && i < s.Length; i++)
{
if (g[ans] <= s[i])
{
ans++;
}
}

return ans;
}
}