added Assign Cookies (easy)

Author: minhyeong-joe

Easy/AssignCookies/README.md

@@ -0,0 +1,33 @@
+
+# Assign Cookies
+[Leetcode Link](https://leetcode.com/problems/assign-cookies/)
+
+## Problem:
+
+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.
+
+## Example:
+
+```
+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.
+```
+```
+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.
+```
+
+## Note:
+
+- You may assume the greed factor is always positive.
+- You cannot assign more than one cookie to one child.

Easy/AssignCookies/Solution.java

@@ -0,0 +1,38 @@
+package Easy.AssignCookies;
+
+import java.util.Arrays;
+
+/**
+ * Solution
+ */
+public class Solution {
+
+ // test driver
+ public static void main(String[] args) {
+ Solution sol = new Solution();
+ int[] greeds = { 1, 2, 2, 1, 3, 5 };
+ int[] sizes = { 1, 2, 2, 2, 2 };
+ System.out.println(sol.findContentChildren(greeds, sizes));
+ }
+
+ public int findContentChildren(int[] g, int[] s) {
+ int fed = 0;
+ // sort both greed factors and cookie sizes
+ Arrays.sort(g);
+ Arrays.sort(s);
+ System.out.println(Arrays.toString(g));
+ System.out.println(Arrays.toString(s));
+ int i = 0;
+ int j = 0;
+ while (i < g.length && j < s.length) {
+ if (g[i] <= s[j]) {
+ // feed the cookie
+ fed++;
+ i++;
+ }
+ j++;
+ }
+ return fed;
+ }
+
+}

README.md

@@ -40,6 +40,7 @@ Languages used: Java and Python
  - [Remove Duplicates from Sorted List](Easy/RemoveDuplicatesFromSortedList)
  - [Longest Continuous Increasing Subsequence](Easy/LongestIncreasingSubsequence)
  - [Happy Number](Easy/HappyNumber)
+ - [Assign Cookies](Easy/AssignCookies)
 - Medium
  - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
  - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)