1 解题思想
题目简单来说,就是你有N个孩子,M个蛋糕。
每个蛋糕有自己的尺寸
每个孩子对蛋糕的尺寸有个最小要求,这个孩子接受这个蛋糕,那么尺寸必须达标
那么现在,你的任务就是如何分配这些蛋糕,使得尽量多的孩子接受你的蛋糕。。
解决很简单暴力:
两个数组排序,从小到大
两个指针。。都指向最小的
移动两个指针,使得给每个孩子的蛋糕,都是当前剩余蛋糕里刚好满足他的哪一个
2 原题
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.
3 AC解
public class Solution {
//尽量给每个人能接受的最小的蛋糕就好,直接排序后,两个数组从头开始就好
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int res = 0;
int i = 0;
int j = 0;
while( i < g.length && j < s.length){
if( g[i]<=s[j] ){
i++;
j++;
res++;
} else{
j++;
}
}
return res;
}
}