solve problem Assign Cookies

Author: P-ppc

README.md

@@ -126,6 +126,7 @@ All solutions will be accepted!
 |263|[Ugly Number](https://leetcode-cn.com/problems/ugly-number/description/)|[java/py/js](./algorithms/UglyNumber)|Easy|
 |783|[Minimum Distance Between Bst Nodes](https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/description/)|[java/py/js](./algorithms/MinimumDistanceBetweenBstNodes)|Easy|
 |747|[Largest Number At Least Twice Of Others](https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others/description/)|[java/py/js](./algorithms/LargestNumberAtLeastTwiceOfOthers)|Easy|
+|455|[assign cookies](https://leetcode-cn.com/problems/assign-cookies/description/)|[java/py/js](./algorithms/AssignCookies)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/AssignCookies/README.md

@@ -0,0 +1,2 @@
+# Assign Cookies
+We have to sort the list first, but which type of sort function is the best?

algorithms/AssignCookies/Solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int findContentChildren(int[] g, int[] s) {
+        Arrays.sort(g);
+        Arrays.sort(s);
+        
+        int count = 0,
+            index = 0;
+        
+        for (int i = 0; i < s.length; i++) {
+            if (s[i] >= g[index]) {
+                count++;
+                index++;
+
+                if (index == g.length) {
+                    break;
+                }
+            }
+        }
+
+        return count;
+    }
+}

algorithms/AssignCookies/solution.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function(g, s) {
+    g.sort((a, b) => a - b)
+    s.sort((a, b) => a - b)
+    
+    let count = 0,
+        index = 0
+        
+    for (let i = 0; i < s.length; i++) {
+        if (s[i] >= g[index]) {
+            count++
+            index++
+            
+            if (index == g.length) {
+                break
+            }
+        }
+    }
+
+    return count
+};

algorithms/AssignCookies/solution.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def findContentChildren(self, g, s):
+        """
+        :type g: List[int]
+        :type s: List[int]
+        :rtype: int
+        """
+        g.sort()
+        s.sort()
+        count = 0
+        index = 0
+        
+        for i in s:
+            if i >= g[index]:
+                count += 1
+                index += 1
+                if index == len(g):
+                    break
+                        
+        return count