packageeasy;

importjava.util.Arrays;

publicclassAssignCookies {

publicintfindContentChildren(int[]g,int[]s) {

Arrays.sort(g);

Arrays.sort(s);

intresult =0;

for (inti =0,j =0;i <g.length &&j <s.length;){

if (s[j] >=g[i]) {

result++;

i++;

}

j++;

}

returnresult;

}

publicstaticvoidmain(String...args){

AssignCookiestest =newAssignCookies();

int[]g =newint[]{1,2,3};

int[]s =newint[]{1,1};

System.out.println(test.findContentChildren(g,s));

}

}

| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes

|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----

|455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/)|[Solution](../../blob/master/EASY/src/easy/AssignCookies.java)| O(n)|O(1)| Easy|

|453|[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)|[Solution](../../blob/master/EASY/src/easy/MinimumMovestoEqualArrayElements.java)| O(n)|O(1)| Easy|

|447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)|[Solution](../../blob/master/EASY/src/easy/NumberofBoomerangs.java)| O(n^2)|O(n) | Easy| HashMap

|441|[Arranging Coins](https://leetcode.com/problems/arrange-coins/)|[Solution](../../blob/master/EASY/src/easy/ArrangingCoins.java)| O(n)|O(1)| Easy|