Move tests to its own files Round 4

Author: ignacio-chiazzo

LeetcodeProblems/Flood_Fill.js

@@ -29,7 +29,6 @@ The given starting pixel will satisfy 0 <= sr < image.length and 0 <= sc < image
 The value of each color in image[i][j] and newColor will be an integer in [0, 65535].
 */
 
-
 var floodFill = function(image, sr, sc, newColor) {
   var oldColor = image[sr][sc];
 

LeetcodeProblems/Implement_stack_using_queues.js

@@ -77,23 +77,4 @@ class MyStack  {
   };
 }
 
-var main = function() {
-  test();
-}
-
-var test = function () {
-  var myStack = new MyStack();
-  myStack.push(4);
-  myStack.push(3);
-  myStack.push(2);
-  myStack.push(1);
-  assert.equal(myStack.pop(), 1);
-  assert.equal(myStack.top(), 2);
-  myStack.push(1);
-  assert.equal(myStack.top(), 1);
-  assert.equal(myStack.pop(), 1);
-  assert.equal(myStack.pop(), 2);
-  assert.equal(myStack.pop(), 3);
-}
-
-module.exports.main = main;
+module.exports.MyStack = MyStack;

LeetcodeProblems/Kth_Largest_Element_in_an_Array.js

@@ -57,15 +57,4 @@ var swap = function(nums, a, b) {
   nums[b] = temp;
 }
 
-var main = function(nums) {
-  test();
-}
-
-function test() {
-  assert.equal(findKthLargest([3,2,1,5,6,4], 2), 5);
-  assert.equal(findKthLargest([3,2,3,1,2,4,5,5,6], 4), 4);
-  assert.equal(findKthLargest([0], 1), 0);
-  assert.equal(findKthLargest([], 1), undefined);
-}
-
-module.exports.main = main;
+module.exports.findKthLargest = findKthLargest;

LeetcodeProblems/Linked_List_Cycle_II.js

@@ -57,34 +57,4 @@ var detectCycle2 = function(head) {
   return null;
 };
 
-var main = function() {
-  test();
-}
-
-var test = function() {
-  const cycle = buildCycle();
-  var list = cycle.list;
-  var nodeCycle = cycle.nodeCycle;
-  assert.equal(detectCycle(list), nodeCycle);
-}
-
-function buildCycle() {
-  var node1 =  ListNode.linkenList([1,2,3,4,5]);
-  var node2 =  new ListNode(2);
-  var node3 =  new ListNode(3);
-  var node4 =  new ListNode(4);
-  var node5 =  new ListNode(5);
-
-  node1.next = node2;
-  node2.next = node3;
-  node3.next = node4;
-  node4.next = node5;
-  node5.next = node2;
-
-  return {
-    list: node1,
-    nodeCycle: node2,
-  };
-}
-
-module.exports.main = main;
+module.exports.detectCycle = detectCycle;

LeetcodeProblems/Longest_Consecutive_Sequence.js

@@ -13,7 +13,6 @@ Output: 4
 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
 */
 
-
 /**
  * @param {number[]} nums
  * @return {number}
@@ -54,16 +53,4 @@ var longestConsecutive = function(nums) {
   return cons;
 };
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(longestConsecutive([100, 1, 200, 3, 2, 400, 201]), 3);
-  assert.equal(longestConsecutive([1,2,3,4, 100, 1, 200, 3, 2, 400, 201]), 4);
-  assert.equal(longestConsecutive([1, 400, 201, 403, 398]), 1);
-  assert.equal(longestConsecutive([]), 0);
-  assert.equal(longestConsecutive([2]), 1);
-}
-
-module.exports.main
+module.exports.longestConsecutive = longestConsecutive;

LeetcodeProblemsTests/Flood_Fill_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const floodFill = require('../LeetcodeProblems/Flood_Fill').floodFill;
 
 function test() {
   assert.deepEqual(

LeetcodeProblemsTests/Group_Anagrams_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const groupAnagrams = require('../LeetcodeProblems/Group_Anagrams').groupAnagrams;
 
 function test() {
   assert.deepEqual(

LeetcodeProblemsTests/Implement_stack_using_queues_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const MyStack = require('../LeetcodeProblems/Implement_stack_using_queues').MyStack;
 
 var test = function () {
   var myStack = new MyStack();

LeetcodeProblemsTests/Kth_Largest_Element_in_an_Array_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const findKthLargest = require('../LeetcodeProblems/Kth_Largest_Element_in_an_Array').findKthLargest;
 
 function test() {
   assert.equal(findKthLargest([3,2,1,5,6,4], 2), 5);

LeetcodeProblemsTests/Linked_List_Cycle_II_Test.js

@@ -1,5 +1,6 @@
 const assert = require('assert');
 var ListNode = require('../UtilsClasses/ListNode').ListNode;
+const detectCycle = require('../LeetcodeProblems/Linked_List_Cycle_II').detectCycle;
 
 var test = function() {
   const cycle = buildCycle();