Move to tests - Round 7

Author: ignacio-chiazzo

LeetcodeProblems/3Sum.js

@@ -18,6 +18,7 @@ A solution set is:
   [-1, -1, 2]
 ]
 */
+const assert = require('assert');
 
 /**
  * @param {number[]} nums
@@ -49,12 +50,25 @@ var threeSum = function(nums) {
 };
 
 var main = function() {
-  console.log(threeSum([]));
-  console.log(threeSum([-1, 0, 1, 2, -1, -4]));
-  console.log(threeSum([0]));
-  console.log(threeSum([0, 0]));
-  console.log(threeSum([0, 0, 0]));
-  console.log(threeSum([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]));
+  test();
 }
 
-module.exports.main = main;
+var test = function () {
+  assert.deepEqual(threeSum([]), []);
+  assert.deepEqual(threeSum([0]), []);
+  assert.deepEqual(threeSum([0, 0]), []);
+  assert.deepEqual(
+    threeSum([0, 0, 0]), 
+    [[0, 0, 0]]
+  );
+  assert.deepEqual(
+    threeSum([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]), 
+    [[0, 0, 0]]
+  );
+  assert.deepEqual(
+    threeSum([-1, 0, 1, 2, -1, -4]), 
+    [ [ -1, 2, -1 ], [ 0, 1, -1 ] ]
+  );
+}
+
+module.exports.main = main;

LeetcodeProblems/Add_Two_Numbers.js

@@ -21,7 +21,8 @@ Explanation: 342 + 465 = 807.
  *     this.next = null;
  * }
  */
-
+const assert = require('assert');
+const ListNodeTestHelper = require('../utilsClasses/ListNodeTestHelper');
 var ListNode = require('../UtilsClasses/ListNode').ListNode;
 
 /**
@@ -64,17 +65,30 @@ var addTwoNumbers = function(l1, l2) {
 };
 
 var main = function() {
+  test();
+}
+
+function test() {
   const list1 = ListNode.linkenList([1,2,3,4]);
   const list2 = ListNode.linkenList([1,2,3,4]);
-  console.log(addTwoNumbers(list1, list2));
+  ListNodeTestHelper.assertList(
+    addTwoNumbers(list1, list2),
+    [2, 4, 6, 8]
+  );
 
   const list3 = ListNode.linkenList([1]);
   const list4 = ListNode.linkenList([1,2]);
-  console.log(addTwoNumbers(list3, list4));
+  ListNodeTestHelper.assertList(
+    addTwoNumbers(list3, list4),
+    [2, 2]
+  );
 
   const list5 = ListNode.linkenList([]);
   const list6 = ListNode.linkenList([1,2]);
-  console.log(addTwoNumbers(list5, list6));
+  ListNodeTestHelper.assertList(
+    addTwoNumbers(list5, list6),
+    [1, 2]
+  );
 }
 
-module.exports.main = main;
+module.exports.main = main;

LeetcodeProblems/Award_Budget_Cuts.js

@@ -29,6 +29,7 @@ Constraints:
 
 [output] double
 */
+const assert = require('assert');
 
 var cutAwardBadges = function(nums, newBadge) {
   var currentBadge = 0;
@@ -66,8 +67,18 @@ var findCap = function(nums,  currentBadge, newBadge) {
 }
 
 var main = function() {
-  console.log(cutAwardBadges([2, 100, 50, 120, 1000], 190));
-  console.log(cutAwardBadges([2, 100, 50, 120, 1000], 5));  
+  test();
+}
+
+function test() {
+  assert.deepEqual(
+    cutAwardBadges([2, 100, 50, 120, 1000], 190),
+    [ 47, 47, 47, 47, 2 ]
+  );
+  assert.deepEqual(
+    cutAwardBadges([2, 100, 50, 120, 1000], 5),
+    [ 1, 1, 1, 1, 1 ]
+  );
 }
 
 module.exports.main = main;

LeetcodeProblems/Backspace_String_Compare.js

@@ -31,6 +31,7 @@ Follow up:
 
 Can you solve it in O(N) time and O(1) space?
 */
+const assert = require('assert');
 
 /**
  * @param {string} S
@@ -106,15 +107,19 @@ var backspaceCompare2 = function(S, T) {
 };
 
 var main = function() {
-  console.log(backspaceCompare("ab#c", "ad#c")); // true
-  console.log(backspaceCompare("ab##", "c#d#")); // true
-  console.log(backspaceCompare("a##c", "#a#c")); // true
-  console.log(backspaceCompare("a#c", "b")); // false
+  test();
+}
+
+function test() {
+  assert.equal(backspaceCompare("ab#c", "ad#c"), true); // true
+  assert.equal(backspaceCompare("ab##", "c#d#"), true); // true
+  assert.equal(backspaceCompare("a##c", "#a#c"), true); // true
+  assert.equal(backspaceCompare("a#c", "b"), false); // false
 
-  console.log(backspaceCompare2("ab#c", "ad#c")); // true
-  console.log(backspaceCompare2("ab##", "c#d#")); // true
-  console.log(backspaceCompare2("a##c", "#a#c")); // true
-  console.log(backspaceCompare2("a#c", "b")); // false
+  assert.equal(backspaceCompare2("ab#c", "ad#c"), true); // true
+  assert.equal(backspaceCompare2("ab##", "c#d#"), true); // true
+  assert.equal(backspaceCompare2("a##c", "#a#c"), true); // true
+  assert.equal(backspaceCompare2("a#c", "b"), false); // false
 }
 
-module.exports.main = main;
+module.exports.main = main;