Move tests to its own files Round 3

Author: ignacio-chiazzo

LeetcodeProblems/Deletion_Distance.js

@@ -106,28 +106,6 @@ var min = function(a, b) {
   return (a < b) ? a : b;
 }
 
-function main() {
-  test();
-}
-
-function test() {
-  assert.equal(deletionDistance("dog", "frog"), 3);
-  assert.equal(deletionDistance("some", "some"), 0);
-  assert.equal(deletionDistance("some", "thing"), 9);
-  assert.equal(deletionDistance("", ""), 0);
-
-  assert.equal(deletionDistance2("dog", "frog"), 3);
-  assert.equal(deletionDistance2("some", "some"), 0);
-  assert.equal(deletionDistance2("some", "thing"), 9);
-  assert.equal(deletionDistance2("", ""), 0);
-
-  assert.equal(deletionDistanceDP("dog", "frog"), 3);
-  assert.equal(deletionDistanceDP("some", "some"), 0);
-  assert.equal(deletionDistanceDP("some", "thing"), 9);
-  assert.equal(deletionDistanceDP("", ""), 0);
-}
-
 module.exports.deletionDistance = deletionDistance;
 module.exports.deletionDistance2 = deletionDistance2;
 module.exports.deletionDistanceDP = deletionDistanceDP;
-

LeetcodeProblems/Flood_Fill.js

@@ -53,15 +53,4 @@ var floodFill = function(image, sr, sc, newColor) {
   return image;
 };
 
-function main() {
-  test();
-}
-
-function test() {
-  assert.deepEqual(
-    [ [ 2, 2, 2 ], [ 2, 2, 0 ], [ 2, 0, 1 ] ],
-    floodFill([[1,1,1],[1,1,0],[1,0,1]], 1, 1, 2)
-  );
-}
-
-module.exports.main = main;
+module.exports.floodFill = floodFill;

LeetcodeProblems/Generate_Parenthesis.js

@@ -77,18 +77,4 @@ var insertAt = function(str, position, value) {
   return str.slice(0, position) + value + str.slice(position);
 }
 
-function main() {
-  console.log("Approach 1");
-  [0, 1, 2, 3].forEach(function(elem) {
-    console.log(`${elem}: ${generateParenthesisApproach2(elem)}`);
-  })
-
-  console.log("-------------");
-
-  console.log("Approach 2");
-  [0, 1, 2, 3].forEach(function(elem) {
-    console.log(`${elem}: ${generateParenthesisApproach2(elem)}`);
-  })
-}
-
-module.exports.main = main
+module.exports.generateParenthesisApproach2 = generateParenthesisApproach2;

LeetcodeProblems/Group_Anagrams.js

@@ -19,7 +19,6 @@ All inputs will be in lowercase.
 The order of your output does not matter.
 */
 
-
 var groupAnagrams = function(strs) {
   var ret = [];
   var hashMap = {};
@@ -48,15 +47,4 @@ var sortString = function(str) {
   return str.split("").sort().join("");
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.deepEqual(
-    groupAnagrams(["eat", "tea", "tan", "ate", "nat", "bat"]),
-    [ [ 'eat', 'tea', 'ate' ], [ 'tan', 'nat' ], [ 'bat' ] ]
-  )
-}
-
-module.exports.main = main;
+module.exports.groupAnagrams = groupAnagrams;

LeetcodeProblems/Regular_Expression_Matching.js

@@ -94,7 +94,7 @@ var main = function(){
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.equal(isMatch("aa", "a"), false);
   assert.equal(isMatch("aa", "a*"), true);
   assert.equal(isMatch("a","ab*"), true);

LeetcodeProblems/Remove_Invalid_Parentheses.js

@@ -74,7 +74,7 @@ var main = function() {
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.equal(removeInvalidParentheses("))))(()"), "()");
   assert.equal(removeInvalidParentheses("(()"), "()");
   assert.equal(removeInvalidParentheses("(d))()"), "(d)()");

LeetcodeProblems/Restore_IP_Addresses.js

@@ -45,7 +45,7 @@ var main = function() {
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.deepEqual(restoreIpAddresses("010010"), [ '0.10.0.10', '0.100.1.0']);
   assert.deepEqual(restoreIpAddresses("25525511135"), [ '255.255.11.135', '255.255.111.35' ]);
 }

LeetcodeProblems/Reverse_String_II.js

@@ -43,7 +43,7 @@ var main = function(){
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.equal(reverseStr("abcdefg", 2), "bacdfeg");
   assert.equal(reverseStr("abcdefg", 3), "cbadefg");
   assert.equal(reverseStr("abcdefg", 1), "abcdefg");

LeetcodeProblems/Search_a_2D_Matrix.js

@@ -63,7 +63,7 @@ var main = function(){
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.equal(searchMatrix([], 0), false);
   assert.equal(searchMatrix([[1], [3]], 3), true);
   assert.equal(searchMatrix([[1], [3]], 1), true);

LeetcodeProblems/Search_a_2D_Matrix_II.js

@@ -55,7 +55,7 @@ var main = function(n) {
   test();
 }
 
-var test = function(n) {
+var test = function() {
   assert.equal(searchMatrix(matrix1, 5), true);
   assert.equal(searchMatrix(matrix1, 0), false);
   assert.equal(searchMatrix(matrix1, 15), true);