Move to tests - Round 2

Author: ignacio-chiazzo

LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js

@@ -126,5 +126,3 @@ var main = function() {
 }
 
 module.exports.main = main;
-
-main();

LeetcodeProblems/Regular_Expression_Matching.js

@@ -98,5 +98,4 @@ var main = function(){
   console.log(isMatch("mississippi", "mis*is*p*."));
 }
 
-main();
 module.exports.main = main;

LeetcodeProblems/Simplify_Path.js

@@ -19,6 +19,7 @@ In this case, you should return "/".
 Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".
 In this case, you should ignore redundant slashes and return "/home/foo".
 */
+const assert = require('assert');
 
 var simplifyPath = function(path) {
   var queue = [];
@@ -66,6 +67,7 @@ var main = function(){
   console.log(simplifyPath("/a/./b/../../c/")); // => "/c"
   console.log(simplifyPath("/a/../../b/../c//.//")); // => "/c"
   console.log(simplifyPath("/a//b////c/d//././/..")) // => "/a/b/c"
+  
 }
 
 module.exports.main = main

LeetcodeProblems/Spiral_Matrix.js

@@ -23,6 +23,7 @@ Input:
 ]
 Output: [1,2,3,4,8,12,11,10,9,5,6,7]
 */
+const assert = require('assert');
 
 /**
  * @param {number[][]} matrix
@@ -72,8 +73,11 @@ var main = function() {
    [ 4, 5, 6 ],
    [ 7, 8, 9 ]
   ]
-  
-  console.log(spiralOrder(matrix));
+
+  assert.deepEqual(
+    spiralOrder(matrix),
+    [1, 2, 3, 6, 9, 8, 7, 4, 5]
+  )
 }
 
 module.exports.main = main;

LeetcodeProblems/Subarray_Sum_Equals_K.js

@@ -12,7 +12,7 @@ Note:
 The length of the array is in range [1, 20,000].
 The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].
 */
-
+const assert = require('assert');
 
 /**
  * @param {number[]} nums
@@ -61,11 +61,14 @@ var subarraySum2 = function(nums, k) {
 };
 
 var main = function() {
-  console.log(subarraySum([1,1,1], 2));
-  console.log(subarraySum([1], 0));
-  console.log(subarraySum([0], 0));
-  console.log(subarraySum([0,0,0,0,0], 0));
+  test();
 }
 
-module.exports.main = main;
+var test  = function() {
+  assert.strictEqual(subarraySum([1,1,1], 2), 2);
+  assert.strictEqual(subarraySum([1], 0), 0);
+  assert.strictEqual(subarraySum([0], 0), 1);
+  assert.strictEqual(subarraySum([0,0,0,0,0], 0), 15);
+}
 
+module.exports.main = main;

LeetcodeProblems/Subsets.js

@@ -22,6 +22,8 @@ Output:
 ]
 */
 
+const assert = require('assert');
+
 var subsets = function(nums) {
   var ret = [];
 
@@ -37,7 +39,20 @@ var subsets = function(nums) {
 };
 
 function main() {
-  console.log(subsets([1,2,3]));
+  test();
 }
-  
+
+function test() {
+  assert.deepEqual(subsets([]), [[]]);
+  assert.deepEqual(subsets([1]), [[1], []]);
+  assert.deepEqual(
+    subsets([1,2]), 
+    [[1, 2], [1], [2], []]
+  );
+  assert.deepEqual(
+    subsets([1, 2, 3]), 
+    [[1, 2, 3], [1, 2], [1, 3], [1], [2, 3], [2], [3], []]
+  );
+}
+
 module.exports.main = main;

LeetcodeProblems/Sum_Of_Square_Numbers.js

@@ -14,6 +14,8 @@ Input: 3
 Output: False
 */
 
+const assert = require('assert');
+
 /**
  * @param {number} c
  * @return {boolean}
@@ -34,12 +36,17 @@ var judgeSquareSum = function(c) {
 };
 
 var main = function() {
-  console.log(judgeSquareSum(0));
-  console.log(judgeSquareSum(1));
-  console.log(judgeSquareSum(5));
-  console.log(judgeSquareSum(16));
-  console.log(judgeSquareSum(24));
-  console.log(judgeSquareSum(25));
+  test();
+}
+
+var test = function() {
+  assert.strictEqual(judgeSquareSum(0), true);
+  assert.strictEqual(judgeSquareSum(1), true);
+  assert.strictEqual(judgeSquareSum(5), true);
+  assert.strictEqual(judgeSquareSum(16), true);
+  assert.strictEqual(judgeSquareSum(24), false);
+  assert.strictEqual(judgeSquareSum(25), true);
 }
 
 module.exports.main = main;
+

LeetcodeProblems/Swap_Nodes_In_Pairs.js

@@ -50,17 +50,14 @@ var swapPairs = function(head) {
 };
 
 var main = function() {
-
-  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([2])), [2, 3]);
   test();
 }
 
 var test = function () {
-  // TODOOOOOOOOOO
-  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2,3,4])), [2,1,4,3]);
-  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([])), []);
-  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1])), [1]);
-  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2])), [2, 3]);
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2,3,4])), [2,1,4,3]);
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([])), []);
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1])), [1]);
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2])), [2, 1]);
 }
 
 module.exports.main = main;

LeetcodeProblems/Unique_Binary_Search_Trees.js

@@ -130,5 +130,4 @@ var test = function () {
   assert.strictEqual(numTrees3(5), 42); 
 }
 
-module.exports.main = main
-main();
+module.exports.main = main