Move tests to its own files Round 6

Author: ignacio-chiazzo

LeetcodeProblems/Number_of_Islands.js

@@ -61,23 +61,4 @@ var colorIsland = function(grid, i, j, rowsCount, columnsCount) {
   colorIsland(grid, i, j + 1, rowsCount, columnsCount);
 }
 
-var main = function() {  
-  test();
-}
-
-function test() {
-  assert.equal(numIslands([[1]]), 1);
-  assert.equal(numIslands([]), 0);
-  assert.equal(numIslands(
-    [
-      ["1","1","1","1","0"],
-      ["1","1","0","1","0"],
-      ["1","1","0","0","0"],
-      ["0","0","0","0","0"]
-    ],
-  ),
-  1
-  );
-}
-
-module.exports.main = main;
+module.exports.numIslands = numIslands;

LeetcodeProblems/Number_of_Segments_in_a_String.js

@@ -33,17 +33,4 @@ var countSegments = function(s) {
   return count;
 };
 
-function main() {
-  test();
-}
-
-function test() {
-  assert.equal(countSegments(" "), 0);
-  assert.equal(countSegments("    "), 0);
-  assert.equal(countSegments("ab cd ef"), 3);
-  assert.equal(countSegments("  ab cd ef"), 3);
-  assert.equal(countSegments("ab cd ef  "), 3);
-  assert.equal(countSegments(" ab cd ef "), 3);
-}
-
-module.exports.main = main
+module.exports.countSegments = countSegments;

LeetcodeProblems/Permutations.js

@@ -18,7 +18,6 @@ Output:
 ]
 */
 
-
 var permute = function(nums) {
   return permuteAux(nums, 0, [], new Set());
 };
@@ -39,24 +38,4 @@ var permuteAux = function(nums, pos, currentSol, set) {
   return ret;
 }
 
-var main = function() {  test();
-}
-
-function test() {
-  // assert.deepEqual(
-  assert.deepEqual(permute([]), [ [] ]);
-  assert.deepEqual(permute([1]), [ [ 1 ] ]);
-  assert.deepEqual(
-    permute([1,2,3]), 
-    [
-      [ 1, 2, 3 ],
-      [ 1, 3, 2 ],
-      [ 2, 1, 3 ],
-      [ 2, 3, 1 ],
-      [ 3, 1, 2 ],
-      [ 3, 2, 1 ]
-    ]
-  );
-}
-
-module.exports.main = main;
+module.exports.permute = permute;

LeetcodeProblems/Permutations_II.js

@@ -46,35 +46,4 @@ var permuteUniqueAux = function(n, map, currentSol) {
   return ret;
 };
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.deepEqual(
-    permuteUnique([1,1,2]),
-    [ [ '1', '1', '2' ], [ '1', '2', '1' ], [ '2', '1', '1' ] ]
-  );
-  assert.deepEqual(
-    permuteUnique([1,3,2,1]),
-    [
-      [ '1', '1', '2', '3' ],
-      [ '1', '1', '3', '2' ],
-      [ '1', '2', '1', '3' ],
-      [ '1', '2', '3', '1' ],
-      [ '1', '3', '1', '2' ],
-      [ '1', '3', '2', '1' ],
-      [ '2', '1', '1', '3' ],
-      [ '2', '1', '3', '1' ],
-      [ '2', '3', '1', '1' ],
-      [ '3', '1', '1', '2' ],
-      [ '3', '1', '2', '1' ],
-      [ '3', '2', '1', '1' ]
-    ]
-  );
-  assert.deepEqual(permuteUnique([]), [ [] ]);
-
-  assert.deepEqual(permuteUnique([1,1]), [ [ '1', '1' ] ]);
-}
-
-module.exports.main = main;
+module.exports.permuteUnique = permuteUnique;

LeetcodeProblems/Permutations_With_Duplicates.js

@@ -29,28 +29,4 @@ var subsetWithoutDuplicatesAux = function(nums, current, sol) {
   })
 }
 
-function main() {
-  test();
-}
-
-var test = function() {
-  assert.deepEqual(
-    subsetWithoutDuplicates([1,1,2,3]),
-    [
-      [ 1, 1, 2, 3 ],
-      [ 1, 1, 3, 2 ],
-      [ 1, 2, 1, 3 ],
-      [ 1, 2, 3, 1 ],
-      [ 1, 3, 1, 2 ],
-      [ 1, 3, 2, 1 ],
-      [ 2, 1, 1, 3 ],
-      [ 2, 1, 3, 1 ],
-      [ 2, 3, 1, 1 ],
-      [ 3, 1, 1, 2 ],
-      [ 3, 1, 2, 1 ],
-      [ 3, 2, 1, 1 ]
-    ]
-  );
-}
-main();
-module.exports.main = main;
+module.exports.subsetWithoutDuplicates = subsetWithoutDuplicates;

LeetcodeProblems/Permutations_Without_Duplicates.js

@@ -18,45 +18,26 @@ Output:
 ]
 */
 
-
-// Permutations wihto
-var subsetWithDuplicates = function(nums) {
+// Permutations without Duplicates
+var subsetWithoutDuplicates = function(nums) {
   if(nums.lenght == 0){
     return;
   }
   var solution = [];
-  subsetWithDuplicatesAux(nums, [], solution);
+  subsetWithoutDuplicatesAux(nums, [], solution);
   return solution;
 }
 
-var subsetWithDuplicatesAux = function(nums, current, sol) {
+var subsetWithoutDuplicatesAux = function(nums, current, sol) {
   if(nums.length == 0){
     sol.push(current);
   }
 
   for(var i = 0; i < nums.length; i++) {
     var newCurrent = [...current, nums[i]]
     var newNums = nums.filter(function(num, index) { return index !== i });
-    subsetWithDuplicatesAux(newNums, newCurrent, sol);
+    subsetWithoutDuplicatesAux(newNums, newCurrent, sol);
   }
 }
-    
-function main() {
-  test();
-}
-
-var test = function() {
-  assert.deepEqual(
-    subsetWithDuplicates([1,2,3]),
-    [
-      [ 1, 2, 3 ],
-      [ 1, 3, 2 ],
-      [ 2, 1, 3 ],
-      [ 2, 3, 1 ],
-      [ 3, 1, 2 ],
-      [ 3, 2, 1 ]
-    ]
-  );
-}
 
-module.exports.main = main;
+module.exports.subsetWithoutDuplicates = subsetWithoutDuplicates;

LeetcodeProblems/Regular_Expression_Matching.js

@@ -90,17 +90,4 @@ var canBeZero = function(pattern, posPat) {
   return posPat == pattern.length;
 }
 
-var main = function(){
-  test();
-}
-
-var test = function() {
-  assert.equal(isMatch("aa", "a"), false);
-  assert.equal(isMatch("aa", "a*"), true);
-  assert.equal(isMatch("a","ab*"), true);
-  assert.equal(isMatch("ab", ".*"), true);
-  assert.equal(isMatch("aab", "c*a*b"), true);
-  assert.equal(isMatch("mississippi", "mis*is*p*."), false);
-}
-
-module.exports.main = main;
+module.exports.isMatch = isM.isMatch;

LeetcodeProblems/Remove_Invalid_Parentheses.js

@@ -20,7 +20,6 @@ Input: ")("
 Output: [""]
 */
 
-
 /**
  * @param {string} s
  * @return {string[]}
@@ -70,15 +69,4 @@ var isValid = function(s) {
   return leftCount === 0;
 }
 
-var main = function() {
-  test();
-}
-
-var test = function() {
-  assert.equal(removeInvalidParentheses("))))(()"), "()");
-  assert.equal(removeInvalidParentheses("(()"), "()");
-  assert.equal(removeInvalidParentheses("(d))()"), "(d)()");
-  assert.equal(removeInvalidParentheses("(())"), "(())");
-}
-
-module.exports.main = main;
+module.exports.removeInvalidParentheses = removeInvalidParentheses;

LeetcodeProblems/Restore_IP_Addresses.js

@@ -10,7 +10,6 @@ Input: "25525511135"
 Output: ["255.255.11.135", "255.255.111.35"]
 */
 
-
 var restoreIpAddresses = function(s) {
   var restore = restoreInputBits("", s, 4);
 
@@ -41,13 +40,4 @@ var restoreInputBits = function(partial, s, num) {
   return [...oneNum, ...twoNums, ...threeNums];
 }
 
-var main = function() {
-  test();
-}
-
-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' ]);
-}
-
-module.exports.main = main
+module.exports.restoreIpAddresses = restoreIpAddresses;

LeetcodeProblems/Reverse_String_II.js

@@ -11,7 +11,6 @@ The string consists of lower English letters only.
 Length of the given string and k will in the range [1, 10000]
 */
 
-
 var reverseStr = function(s, k) {
   if(k <= 1)
     return s;
@@ -39,15 +38,4 @@ var reverse = function(s, start, end) {
   return ret;
 }
 
-var main = function(){
-  test();
-}
-
-var test = function() {
-  assert.equal(reverseStr("abcdefg", 2), "bacdfeg");
-  assert.equal(reverseStr("abcdefg", 3), "cbadefg");
-  assert.equal(reverseStr("abcdefg", 1), "abcdefg");
-  assert.equal(reverseStr("abcdefg", 0), "abcdefg");  
-}
-
-module.exports.main = main
+module.exports.reverseStr = reverseStr;

LeetcodeProblemsTests/Number_of_Islands_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const numIslands = require('../LeetcodeProblems/Number_of_Islands').numIslands;
 
 function test() {
   assert.equal(numIslands([[1]]), 1);

LeetcodeProblemsTests/Number_of_Segments_in_a_String_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const countSegments = require('../LeetcodeProblems/Number_of_Segments_in_a_String').countSegments;
 
 function test() {
   assert.equal(countSegments(" "), 0);

LeetcodeProblemsTests/Permutations_II_Test.js

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

LeetcodeProblemsTests/Permutations_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const permute = require('../LeetcodeProblems/Permutations').permute;
 
 function test() {
   assert.deepEqual(permute([]), [ [] ]);

LeetcodeProblemsTests/Permutations_With_Duplicates_Test.js

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

LeetcodeProblemsTests/Permutations_Without_Duplicates_Test.js

@@ -1,8 +1,9 @@
 const assert = require('assert');
+const subsetWithoutDuplicates = require('../LeetcodeProblems/Permutations_Without_Duplicates').subsetWithoutDuplicates;
 
 var test = function() {
   assert.deepEqual(
-    subsetWithDuplicates([1,2,3]),
+    subsetWithoutDuplicates([1,2,3]),
     [
       [ 1, 2, 3 ],
       [ 1, 3, 2 ],

LeetcodeProblemsTests/Regular_Expression_Matching_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const isMatch = require('../LeetcodeProblems/Regular_Expression_Matching').isMatch;
 
 var test = function() {
   assert.equal(isMatch("aa", "a"), false);

LeetcodeProblemsTests/Remove_Invalid_Parentheses_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const removeInvalidParentheses = require('../LeetcodeProblems/Remove_Invalid_Parentheses').removeInvalidParentheses;
 
 var test = function() {
   assert.equal(removeInvalidParentheses("))))(()"), "()");

LeetcodeProblemsTests/Restore_IP_Addresses_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const restoreIpAddresses = require('../LeetcodeProblems/Restore_IP_Addresses').restoreIpAddresses;
 
 var test = function() {
   assert.deepEqual(restoreIpAddresses("010010"), [ '0.10.0.10', '0.100.1.0']);

LeetcodeProblemsTests/Reverse_String_II_Test.js

@@ -1,4 +1,5 @@
 const assert = require('assert');
+const reverseStr = require('../LeetcodeProblems/Reverse_String_II').reverseStr;
 
 var test = function() {
   assert.equal(reverseStr("abcdefg", 2), "bacdfeg");