Merge pull request #37 from ignacio-chiazzo/tests

Tests

Author: ignacio-chiazzo

LeetcodeProblems/3Sum.js

@@ -18,7 +18,6 @@ A solution set is:
   [-1, -1, 2]
 ]
 */
-const assert = require('assert');
 
 /**
  * @param {number[]} nums
@@ -49,26 +48,4 @@ var threeSum = function(nums) {
   return ret;
 };
 
-var main = function() {
-  test();
-}
-
-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;
+module.exports.threeSum = threeSum;

LeetcodeProblems/Add_Two_Numbers.js

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

LeetcodeProblems/Award_Budget_Cuts.js

@@ -29,8 +29,6 @@ Constraints:
 
 [output] double
 */
-const assert = require('assert');
-
 var cutAwardBadges = function(nums, newBadge) {
   var currentBadge = 0;
   for(var i = 0; i < nums.length; i++)
@@ -66,19 +64,4 @@ var findCap = function(nums,  currentBadge, newBadge) {
   return nums[iter] + (-diff) / iter;
 }
 
-var main = function() {
-  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;
+module.exports.cutAwardBadges = cutAwardBadges;

LeetcodeProblems/Backspace_String_Compare.js

@@ -31,7 +31,6 @@ Follow up:
 
 Can you solve it in O(N) time and O(1) space?
 */
-const assert = require('assert');
 
 /**
  * @param {string} S
@@ -106,20 +105,5 @@ var backspaceCompare2 = function(S, T) {
   return stackS.length === 0 && stackT.length === 0;
 };
 
-var main = function() {
-  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
-
-  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.backspaceCompare = backspaceCompare;
+module.exports.backspaceCompare2 = backspaceCompare2;

LeetcodeProblems/Best_Time_To_Buy_And_Sell_Stock_II.js

@@ -27,7 +27,6 @@ Input: [7,6,4,3,1]
 Output: 0
 Explanation: In this case, no transaction is done, i.e. max profit = 0.
 */
-const assert = require('assert');
 
 /**
  * @param {number[]} prices
@@ -56,13 +55,4 @@ var maxProfit = function(prices) {
   return profit;
 };
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(maxProfit([7,1,5,3,6,4]), 7);
-  assert.equal(maxProfit([7,1,5,3320,6,4]), 3319);
-}
-
-module.exports.main = main;
+module.exports.maxProfit = maxProfit;

LeetcodeProblems/Binary_Gap.js

@@ -36,7 +36,6 @@ Explanation:
 8 in binary is 0b1000.
 There aren't any consecutive pairs of 1's in the binary representation of 8, so we return 0.
 */
-const assert = require('assert');
 
 /**
  * @param {number} N
@@ -61,13 +60,4 @@ var binaryGap = function(N) {
   return maxDist;
 };
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(binaryGap(22), 2); // 10110
-  assert.equal(binaryGap(8), 0); // 1000
-}
-
-module.exports.main = main;
+module.exports.binaryGap = binaryGap;

LeetcodeProblems/Clone_Graph.js

@@ -40,7 +40,6 @@ You don't need to understand the serialization to solve the problem.
  * }
  */
 
-
 // SOLUTION 1 Using DFS
 /**
  * @param {UndirectedGraphNode} graph

LeetcodeProblems/Coin_Change.js

@@ -18,7 +18,6 @@ Output: -1
 Note:
 You may assume that you have an infinite number of each kind of coin.
 */
-const assert = require('assert');
 
 // Solution 3 
 var coinChange = function(coins, amount) {
@@ -102,16 +101,4 @@ var min = function(a, b, c) {
   return (b < c) ? b : c;
 }
 
-function main() {
-  test();
-}
-
-function test() {
-  assert.equal(coinChange([], 3), -1);
-  assert.equal(coinChange([2], 3), -1);
-  assert.equal(coinChange([1, 2, 5], 11), 3);
-  assert.equal(coinChange([3, 7, 405, 436], 8839), 25);
-  assert.equal(coinChange([370, 417, 408, 156, 143, 434, 168, 83, 177, 280, 117], 9953), 24);
-}
-
-module.exports.main = main;
+module.exports.coinChange = coinChange;

LeetcodeProblems/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js

@@ -27,8 +27,6 @@ Return the following binary tree:
  *     this.left = this.right = null;
  * }
  */
-const assert = require('assert');
-
 var TreeNode = require('../UtilsClasses/TreeNode').TreeNode;
 
 /**
@@ -59,12 +57,4 @@ var buildTreeAux = function(preorder, pl, ph, inorder, il, ih) {
   return ret;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  console.log(buildTree([3,9,20,15,7], [9,3,15,20,7]));
-}
-
-module.exports.main = main
+module.exports.buildTree = buildTree

LeetcodeProblems/Deletion_Distance.js

@@ -18,7 +18,6 @@ output: 9
 input:  str1 = "", str2 = ""
 output: 0
 */
-const assert = require('assert');
 
 // Solution 3 Using DP
 var deletionDistanceDP = function(str1, str2) {
@@ -107,25 +106,6 @@ var min = function(a, b) {
   return (a < b) ? a : b;
 }
 
-function main() {
-  test();
-}
-
-function test() {
-  assert.equal(deletionDistance("dog", "frog"), 3);
-  assert.equal(deletionDistance("some", "some"), 0);
-  assert.equal(deletionDistance("some", "thing"), 9);
-  assert.equal(deletionDistance("", ""), 0);
-
-  assert.equal(deletionDistance2("dog", "frog"), 3);
-  assert.equal(deletionDistance2("some", "some"), 0);
-  assert.equal(deletionDistance2("some", "thing"), 9);
-  assert.equal(deletionDistance2("", ""), 0);
-
-  assert.equal(deletionDistanceDP("dog", "frog"), 3);
-  assert.equal(deletionDistanceDP("some", "some"), 0);
-  assert.equal(deletionDistanceDP("some", "thing"), 9);
-  assert.equal(deletionDistanceDP("", ""), 0);
-}
-
-module.exports.main = main
+module.exports.deletionDistance = deletionDistance;
+module.exports.deletionDistance2 = deletionDistance2;
+module.exports.deletionDistanceDP = deletionDistanceDP;