Move tests to its own files Round 5

ignacio-chiazzo · ignacio-chiazzo · commit b68f155e638b · 2020-09-06T17:46:51.000-04:00
diff --git a/LeetcodeProblems/Longest_Palindromic_Substring.js b/LeetcodeProblems/Longest_Palindromic_Substring.js
@@ -15,7 +15,6 @@ Input: "cbbd"
 Output: "bb"
 */
 
-
 /**
  * @param {string} s
  * @return {string}
@@ -64,17 +63,4 @@ var longestPalindrome = function(str) {
   return str.slice(posPalStart, posPalStart + maxPal);
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(longestPalindrome("pabcdcbte"), "bcdcb");
-  assert.equal(longestPalindrome("bb"), "bb");
-  assert.equal(longestPalindrome(""), "");
-  assert.equal(longestPalindrome("bbb"), "bbb");
-  assert.equal(longestPalindrome("bbbb"), "bbbb");
-  assert.equal(longestPalindrome("ptabbbbat"), "tabbbbat");
-}
-
-module.exports.main = main
+module.exports.longestPalindrome = longestPalindrome
diff --git a/LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js b/LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js
@@ -93,37 +93,5 @@ var pathTo = function(root, value) {
   return [];
 }
 
-var main = function() {
-  var root = new TreeNode(3);
-  
-  var right = new TreeNode(1);
-  right.left = new TreeNode(0);
-  right.right = new TreeNode(8);
-  root.right = right;
-
-  var left = new TreeNode(5);
-  left.left = new TreeNode(6);
-  
-  var tempRight = new TreeNode(2);
-  tempRight.left = new TreeNode(7);
-  tempRight.right = new TreeNode(4);
-  left.right = tempRight;
-
-  root.left = left;
-
-  //         _______3______
-  //        /              \
-  //     ___5__          ___1__
-  //    /      \        /      \
-  //    6      _2       0       8
-  //          /  \
-  //          7   4
-
-  console.log(lowestCommonAncestor(root, left, tempRight.right));
-  console.log(lowestCommonAncestor(root, left, right));
-
-  console.log(lowestCommonAncestor2(root, left, tempRight.right));
-  console.log(lowestCommonAncestor2(root, left, right));
-}
-
-module.exports.main = main;
+module.exports.lowestCommonAncestor = lowestCommonAncestor;
+module.exports.lowestCommonAncestor2 = lowestCommonAncestor2;
diff --git a/LeetcodeProblems/Majority_Element.js b/LeetcodeProblems/Majority_Element.js
@@ -45,14 +45,4 @@ var majorityElement = function(nums) {
   return candidate;
 };
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(majorityElement([2,2,3]), 2);
-  assert.equal(majorityElement([2,3,2]), 2);
-  assert.equal(majorityElement([1,1,1,2,3,45,1,2,4,1,1]), 1);
-}
-
-module.exports.main = main
+module.exports.majorityElement = majorityElement;
diff --git a/LeetcodeProblems/Maximal_Square.js b/LeetcodeProblems/Maximal_Square.js
@@ -65,18 +65,4 @@ var getCurrentMaxSideLength = function(matrix, i, j) {
   return max;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(maximalSquare([["1","0"]]), 1);
-  assert.equal(maximalSquare([["1"]]), 1);
-  assert.equal(maximalSquare([["0"]]), 0);
-  assert.equal(
-    maximalSquare([["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]),
-    4
-  );
-}
-
-module.exports.main = main
+module.exports.maximalSquare = maximalSquare;
diff --git a/LeetcodeProblems/Maximun_Subarray.js b/LeetcodeProblems/Maximun_Subarray.js
@@ -34,15 +34,4 @@ var max = function(i, j) {
   return (i > j) ? i : j;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(maxSubArray([]), 0);
-  assert.equal(maxSubArray([-4]), -4);
-  assert.equal(maxSubArray([2]), 2);
-  assert.equal(maxSubArray([4,1,-1,4,5,6,7,-200]), 26);
-}
-
-module.exports.main = main;
+module.exports.maxSubArray = maxSubArray;
diff --git a/LeetcodeProblems/Min_Stack.js b/LeetcodeProblems/Min_Stack.js
@@ -74,19 +74,4 @@ class MinStack {
   }
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  var minStack = new MinStack();
-  minStack.push(-2);
-  minStack.push(0);
-  minStack.push(-3);
-  assert.equal(minStack.getMin(), -3);
-  assert.equal(minStack.pop(), -3);
-  assert.equal(minStack.top(), 0);
-  assert.equal(minStack.getMin(), -2);
-}
-
-module.exports.main = main;
+module.exports.MinStack = MinStack;
diff --git a/LeetcodeProblems/Minimum_Window_Substring.js b/LeetcodeProblems/Minimum_Window_Substring.js
@@ -64,17 +64,4 @@ var getHash = function(t) {
   return hash;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(minWindow("ADOBECODEBANC", "ABC"), "BANC");
-  assert.equal(minWindow("caaec", "cae"), "aec");
-  assert.equal(minWindow("bbacbb", "ab"), "ba");
-  assert.equal(minWindow("abba", "b"), "b");
-  assert.equal(minWindow("abba", "a"), "a");
-  assert.equal(minWindow("abba", ""), "");
-}
-
-module.exports.main
+module.exports.minWindow = minWindow;
diff --git a/LeetcodeProblems/NQueens.js b/LeetcodeProblems/NQueens.js
@@ -70,29 +70,4 @@ var parseSolutions = function(sols, n) {
   return matrixes;
 }
 
-var main = function(n) {
-  printMatrixes(solveNQueens(4), 4);
-  printMatrixes(solveNQueens(5), 5);
-  printMatrixes(solveNQueens(6), 6);
-}
-
-var test = function() {
-}
-
-var printMatrixes = function(matrixes, n) {
-  console.log("Start solution of n: " + n);
-  for(var i = 0; i < matrixes.length; i++) {
-    printMatrix(matrixes[i]);
-  }
-  console.log("End solution of n: " + n);
-}
-
-var printMatrix = function(matrix) {
-  console.log("------------");
-  for(var i = 0; i < matrix.length; i++) {
-    console.log(matrix[i]);
-  }
-  console.log("------------");
-}
-
-module.exports.main = main;
+module.exports.solveNQueens = solveNQueens;
diff --git a/LeetcodeProblems/merge_k_sorted_lists.js b/LeetcodeProblems/merge_k_sorted_lists.js
@@ -76,29 +76,4 @@ var mergeLists = function(list1, list2) {
   return head;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.deepEqual(mergeKLists([]), null);
-  assert.deepEqual(
-    mergeKLists([null]), 
-    null
-  );
-  assert.deepEqual(
-    mergeKLists([null, null]), 
-    null
-  );
-
-  var list1 = ListNode.linkenList([1,2,3]);
-  var list2 = ListNode.linkenList([2,3,4]);
-  var list3 = ListNode.linkenList([5,6]);
-  var list4 = ListNode.linkenList([1,5]);
-  ListNodeTestHelper.assertList(
-    mergeKLists([list1, list2, list3, list4]),
-    [1, 1, 2, 2, 3, 3, 4, 5, 5, 6]
-  );
-}
-
-module.exports.main = main;
+module.exports.mergeKLists = mergeKLists;
diff --git a/LeetcodeProblemsTests/Longest_Palindromic_Substring_Test.js b/LeetcodeProblemsTests/Longest_Palindromic_Substring_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const longestPalindrome = require('../LeetcodeProblems/Longest_Palindromic_Substring').longestPalindrome;
 
 function test() {
   assert.equal(longestPalindrome("pabcdcbte"), "bcdcb");
diff --git a/LeetcodeProblemsTests/Lowest_Common_Ancestor_of_a_Binary_Tree_Test.js b/LeetcodeProblemsTests/Lowest_Common_Ancestor_of_a_Binary_Tree_Test.js
@@ -1,5 +1,7 @@
 const assert = require('assert');
 var TreeNode = require('../UtilsClasses/TreeNode').TreeNode;
+const lowestCommonAncestor = require('../LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree').lowestCommonAncestor;
+const lowestCommonAncestor2 = require('../LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree').lowestCommonAncestor2;
 
 var test = function() {
   var root = new TreeNode(3);
diff --git a/LeetcodeProblemsTests/Majority_Element_Test.js b/LeetcodeProblemsTests/Majority_Element_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const majorityElement = require('../LeetcodeProblems/Majority_Element').majorityElement;
 
 function test() {
   assert.equal(majorityElement([2,2,3]), 2);
diff --git a/LeetcodeProblemsTests/Maximal_Square_Test.js b/LeetcodeProblemsTests/Maximal_Square_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const maximalSquare = require('../LeetcodeProblems/Maximal_Square').maximalSquare;
 
 function test() {
   assert.equal(maximalSquare([["1","0"]]), 1);
diff --git a/LeetcodeProblemsTests/Maximun_Subarray_Test.js b/LeetcodeProblemsTests/Maximun_Subarray_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const maxSubArray = require('../LeetcodeProblems/Maximun_Subarray').maxSubArray;
 
 function test() {
   assert.equal(maxSubArray([]), 0);
@@ -7,4 +8,4 @@ function test() {
   assert.equal(maxSubArray([4,1,-1,4,5,6,7,-200]), 26);
 }
 
-module.exports.test = test;
+module.exports.test = test;
diff --git a/LeetcodeProblemsTests/Min_Stack_Test.js b/LeetcodeProblemsTests/Min_Stack_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const MinStack = require('../LeetcodeProblems/Min_Stack').MinStack;
 
 function test() {
   var minStack = new MinStack();
diff --git a/LeetcodeProblemsTests/Minimum_Window_Substring_Test.js b/LeetcodeProblemsTests/Minimum_Window_Substring_Test.js
@@ -1,4 +1,5 @@
 const assert = require('assert');
+const minWindow = require('../LeetcodeProblems/Minimum_Window_Substring').minWindow;
 
 function test() {
   assert.equal(minWindow("ADOBECODEBANC", "ABC"), "BANC");
diff --git a/LeetcodeProblemsTests/NQueens_Test.js b/LeetcodeProblemsTests/NQueens_Test.js
@@ -1,4 +1,7 @@
 const assert = require('assert');
+const solveNQueens = require('../LeetcodeProblems/NQueens').solveNQueens;
+
+// TODO: Add assertions
 
 var test = function() {
   printMatrixes(solveNQueens(4), 4);
diff --git a/LeetcodeProblemsTests/merge_k_sorted_lists_Test.js b/LeetcodeProblemsTests/merge_k_sorted_lists_Test.js
@@ -1,6 +1,7 @@
 const assert = require('assert');
 const ListNodeTestHelper = require('../utilsClasses/ListNodeTestHelper');
 var ListNode = require('../UtilsClasses/ListNode').ListNode;
+const mergeKLists = require('../LeetcodeProblems/merge_k_sorted_lists').mergeKLists;
 
 function test() {
   assert.deepEqual(mergeKLists([]), null);

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,5 @@`
`1`	`1`	`const assert = require('assert');`
	`2`	`+const longestPalindrome = require('../LeetcodeProblems/Longest_Palindromic_Substring').longestPalindrome;`
`2`	`3`
`3`	`4`	`function test() {`
`4`	`5`	`assert.equal(longestPalindrome("pabcdcbte"), "bcdcb");`