1 package Others;
2
3 import java.util.Arrays;
4
5
6 //Question 455. Assign Cookies
7 /*
8 Assume you are an awesome parent and want to give your children some cookies.
9 But, you should give each child at most one cookie.
10 Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with;
11 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.
12 Your goal is to maximize the number of your content children and output the maximum number.
13
14 Note:
15 You may assume the greed factor is always positive.
16 You cannot assign more than one cookie to one child.
17
18 Example 1:
19 Input: [1,2,3], [1,1]
20
21 Output: 1
22
23 Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.
24 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.
25 You need to output 1.
26 Example 2:
27 Input: [1,2], [1,2,3]
28
29 Output: 2
30
31 Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
32 You have 3 cookies and their sizes are big enough to gratify all of the children,
33 You need to output 2.
34 */
35 public class findContentChildren455 {
36 public static int findContentChildren(int[] g, int[] s) {
37 Arrays.sort(g);
38 Arrays.sort(s);
39 int i=0;
40 for(int j=0;i<g.length&&j<s.length;j++){
41 if(g[i]<=s[j]){
42 i++;
43 }
44 }
45 return i;
46 }
47 public static void main(String[] arg){
48 int[] g={1,2};
49 int[] s={1,1};
50 System.out.println(findContentChildren(g,s));
51 }
52 }