Move to tests - Round 1

Author: ignacio-chiazzo

LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js

@@ -4,7 +4,7 @@ https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
 
 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
 
-According to the definition of LCA on Wikipedia: 
+According to the definition of LCA on Wikipedia:
 “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants 
 (where we allow a node to be a descendant of itself).”
 
@@ -92,7 +92,6 @@ var pathTo = function(root, value) {
   return [];
 }
 
-
 var main = function() {
   var root = new TreeNode(3);
 
@@ -126,4 +125,6 @@ var main = function() {
   console.log(lowestCommonAncestor2(root, left, right));
 }
 
-module.exports.main = main;
+module.exports.main = main;
+
+main();

LeetcodeProblems/Unique_Binary_Search_Trees.js

@@ -22,6 +22,8 @@ Given n = 3, there are a total of 5 unique BST's:
 DP Solution: https://www.programcreek.com/2014/05/leetcode-unique-binary-search-trees-java/
 */
 
+var assert = require('assert');
+
 // Solution 3 using DP
 var numTrees3 = function (n) {
   if (n == 0)
@@ -108,20 +110,25 @@ var numTreesAux1 = function(leftMin, leftMax) {
 }
 
 var main = function() {
-  console.log(numTrees1(1));
-  console.log(numTrees1(2));
-  console.log(numTrees1(3));
-  console.log(numTrees1(5));
-
-  console.log(numTrees2(1));
-  console.log(numTrees2(2));
-  console.log(numTrees2(3));
-  console.log(numTrees2(5));
-
-  console.log(numTrees3(1));
-  console.log(numTrees3(2));
-  console.log(numTrees3(3));
-  console.log(numTrees3(5));
+  test();
+}
+
+var test = function () {
+  assert.strictEqual(numTrees1(1), 1);
+  assert.strictEqual(numTrees1(2), 2);
+  assert.strictEqual(numTrees1(3), 5);
+  assert.strictEqual(numTrees1(5), 42);
+
+  assert.strictEqual(numTrees2(1), 1);
+  assert.strictEqual(numTrees2(2), 2);
+  assert.strictEqual(numTrees2(3), 5);
+  assert.strictEqual(numTrees2(5), 42);
+
+  assert.strictEqual(numTrees3(1), 1);
+  assert.strictEqual(numTrees3(2), 2);
+  assert.strictEqual(numTrees3(3), 5);
+  assert.strictEqual(numTrees3(5), 42); 
 }
 
 module.exports.main = main
+main();

LeetcodeProblems/Unique_Paths.js

@@ -26,6 +26,7 @@ Output: 28
 
 // Solution 1
 // This solution is a naive solution implementing a binary tree and visiting each node.
+var assert = require('assert');
 
 var uniquePaths1 = function(m, n) {
   return uniquePathsAux(0, 0, m, n)
@@ -96,9 +97,12 @@ var uniquePaths3 = function(m, n) {
 };
 
 var main = function() {
-  console.log(uniquePaths1(10,4));
-  console.log(uniquePaths2(10,4));
-  console.log(uniquePaths3(10,4));
+  test();
+}
+
+var test = function() {
+  assert.strictEqual(uniquePaths1(10,4), 220);
+  assert.strictEqual(uniquePaths1(3,2), 3);
 }
 
 module.exports.main = main;

LeetcodeProblems/Valid_Parentheses.js

@@ -32,6 +32,8 @@ Input: "{[]}"
 Output: true
 */
 
+var assert = require('assert');
+
 var isValid = function(s) {
   var stack = [];
   for(var i = 0; i < s.length; i++) {
@@ -57,11 +59,15 @@ var valid = function(parOpen, parClose) {
 }
 
 var main = function(){
-  console.log(isValid(""));
-  console.log(isValid("()"));
-  console.log(isValid("([)]"));
-  console.log(isValid("{[()]}{[()]}"));
-  console.log(isValid("{[())()]}"));
+  test();
+}
+
+var test = function () {
+  assert.strictEqual(isValid(""), true);
+  assert.strictEqual(isValid("()"), true);
+  assert.strictEqual(isValid("([)]"), false);
+  assert.strictEqual(isValid("{[()]}{[()]}"), true);
+  assert.strictEqual(isValid("{[())()]}"), false);
 }
 
 module.exports.main = main

LeetcodeProblems/Verify_Preorder_Serialization_of_a_Binary_Tree.js

@@ -31,6 +31,7 @@ Example 3:
 Input: "9,#,#,1"
 Output: false
 */
+var assert = require('assert');
 
 /**
  * @param {string} preorder
@@ -40,7 +41,7 @@ var isValidSerialization = function(preorder) {
   if(preorder.length === 0)
     return true;
 
-  if(preorder.charAt(0) === "#") 
+  if(preorder.charAt(0) === "#")
     return preorder.length === 1;
 
   var countP = 2;
@@ -64,11 +65,16 @@ var isValidSerialization = function(preorder) {
 };
 
 var main = function() {
-  console.log(isValidSerialization(""));
-  console.log(isValidSerialization("#"));
-  console.log(isValidSerialization("9,3,4,#,#,1,#,#,2,#,6,#,#"));
-  console.log(isValidSerialization("9,#,92,#,#"));
-  console.log(isValidSerialization("9,3,4,#,#,1,#,#,#,2,#,6,#,#"));
+  test();
 }
 
+var test = function() {
+  assert.strictEqual(isValidSerialization(""), true);
+  assert.strictEqual(isValidSerialization(""), true);
+  assert.strictEqual(isValidSerialization("#"), true);
+  assert.strictEqual(isValidSerialization("9,3,4,#,#,1,#,#,2,#,6,#,#"), true);
+  assert.strictEqual(isValidSerialization("9,#,92,#,#"), true);
+  assert.strictEqual(isValidSerialization("9,3,4,#,#,1,#,#,#,2,#,6,#,#"), false);
+};
+
 module.exports.main = main;