455. 分发饼干

Author: w2xi

README.md

@@ -139,6 +139,7 @@
 |451|[根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/)|[JavaScript](./algorithms/sort-characters-by-frequency.js)|Medium|
 |453|[最小操作次数使数组元素相等](https://leetcode.cn/problems/minimum-moves-to-equal-array-elements/)|[JavaScript](./algorithms/minimum-moves-to-equal-array-elements.js)|Easy|
 |454|[四数相加 II](https://leetcode.cn/problems/4sum-ii/)|[JavaScript](./algorithms/4sum-ii.js)|Medium|
+|455|[分发饼干](https://leetcode.cn/problems/assign-cookies/)|[JavaScript](./algorithms/assign-cookies.js)|Easy|
 |485|[最大连续 1 的个数](https://leetcode.cn/problems/max-consecutive-ones/)|[JavaScript](./algorithms/max-consecutive-ones.js)|Easy|
 |491|[递增子序列](https://leetcode.cn/problems/non-decreasing-subsequences/)|[JavaScript](./algorithms/non-decreasing-subsequences.js)|Medium|
 |495|[提莫攻击](https://leetcode.cn/problems/teemo-attacking/)|[JavaScript](./algorithms/teemo-attacking.js)|Easy|

algorithms/assign-cookies.js

@@ -0,0 +1,20 @@
+/**
+ * 455. 分发饼干
+ * @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 j = 0,
+    i = 0;
+  while (j < s.length && i < g.length) {
+    if (s[j] >= g[i]) {
+      i++;
+    }
+    j++;
+  }
+  return i;
+};