Move assignCookies from ArrayList to LeetCode

Author: lewis617

ArrayList/ArrayList.js

@@ -129,20 +129,6 @@ function ArrayList() {
     }
     return -1;
   };
-
-  this.findContentChildren = function (cookies) {
-    this.quickSort();
-    cookies.sort(function (a, b) {
-      return a - b;
-    });
-    var i = 0;  // 满足的孩子数量
-    for (var j = 0; i < array.length && j < cookies.length; j++) {  // 遍历饼干
-      if (array[i] <= cookies[j]) {
-        i++;
-      }
-    }
-    return i;
-  }
 }
 
 module.exports = ArrayList;

ArrayList/ArrayList.test.js

@@ -41,17 +41,4 @@ test('ArrayList', function () {
   expect(array.binarySearch(3)).toBe(2);
   expect(array.binarySearch(6)).toBe(-1);
   expect(array.binarySearch(2)).toBe(1);
-
-  array = createNonSortedArray();
-  expect(array.findContentChildren([1, 1])).toBe(1);
-  expect(array.findContentChildren([1, 2, 3])).toBe(3);
-
-  // test for sort() function, eg: 10 and 9, sort will return a wrong answer.
-  array = new ArrayList();
-  array.insert(10);
-  array.insert(9);
-  array.insert(8);
-  array.insert(7);
-  array.insert(6);
-  expect(array.findContentChildren([7, 6, 5])).toBe(2);
 });

LeetCode/__tests__/assignCookies.test.js

@@ -0,0 +1,6 @@
+var findContentChildren = require('../assignCookies');
+
+test('assignCookies', function () {
+  expect(findContentChildren([1, 3, 5, 4, 2], [1, 1])).toBe(1);
+  expect(findContentChildren([10, 9, 8, 7, 6], [7, 6, 5])).toBe(2);
+});

LeetCode/assignCookies.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function (g, s) {
+  var sortFunc = function (a, b) {
+    return a - b;
+  };
+  g.sort(sortFunc);
+  s.sort(sortFunc);
+  var i = 0;
+  for (var j = 0; i < g.length && j < s.length; j++) {
+    if (g[i] <= s[j]) {
+      i++;
+    }
+  }
+  return i;
+};
+
+module.exports = findContentChildren;