Add js solution to leetcode problem: no.0455

Author: tchx626

solution/0400-0499/0455.Assign Cookies/README.md

@@ -66,6 +66,31 @@
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function (g, s) {
+    let len1 = g.length, len2 = s.length;
+    if (len2 === 0) return 0;
+    g.sort((a, b) => a - b);
+    s.sort((a, b) => a - b);
+    let i = 0, j = 0;
+    while (i < len1 && j < len2) {
+        while (s[j] < g[i]) j++;
+        if (s[j] >= g[i]) {
+            i++;
+            j++;
+        } else break;
+    }
+    return i;
+};
+```
+
 ### **...**
 
 ```

solution/0400-0499/0455.Assign Cookies/README_EN.md

@@ -55,6 +55,31 @@ You need to output 2.
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function (g, s) {
+    let len1 = g.length, len2 = s.length;
+    if (len2 === 0) return 0;
+    g.sort((a, b) => a - b);
+    s.sort((a, b) => a - b);
+    let i = 0, j = 0;
+    while (i < len1 && j < len2) {
+        while (s[j] < g[i]) j++;
+        if (s[j] >= g[i]) {
+            i++;
+            j++;
+        } else break;
+    }
+    return i;
+};
+```
+
 ### **...**
 
 ```

solution/0400-0499/0455.Assign Cookies/Solution.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function (g, s) {
+    let len1 = g.length, len2 = s.length;
+    if (len2 === 0) return 0;
+    g.sort((a, b) => a - b);
+    s.sort((a, b) => a - b);
+    let i = 0, j = 0;
+    while (i < len1 && j < len2) {
+        while (s[j] < g[i]) j++;
+        if (s[j] >= g[i]) {
+            i++;
+            j++;
+        } else break;
+    }
+    return i;
+};