Move tests to its own files Round 7

Author: ignacio-chiazzo

LeetcodeProblems/Best_Time_To_Buy_And_Sell_Stock_II.js

@@ -55,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.maxProfit = maxProfit;

LeetcodeProblems/Escape_The_Ghosts.js

@@ -59,14 +59,4 @@ var getDistance = function(a, b) {
   return horizontalMoves + verticalMoves;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(escapeGhosts([[1, 0], [0, 3]], [0, 1]), true);
-  assert.equal(escapeGhosts([[1, 0]], [2, 0]), false);
-  assert.equal(escapeGhosts([[2, 0]], [1, 0]), true);
-}
-
-module.exports.main = main
+module.exports.escapeGhosts = escapeGhosts;

LeetcodeProblems/SearchIng_Rotated_Sorted_Array.js

@@ -54,12 +54,4 @@ var searchAux = function(nums, target, start, end) {
   }
 }
 
-var main = function(n) {
-  test();
-}
-
-var test = function() {
-  assert.equal(search([4,5,6,7,0,1,2], 5), 1);
-}
-main()
-module.exports.main = main;
+module.exports.search = search;

LeetcodeProblems/Search_a_2D_Matrix.js

@@ -28,7 +28,6 @@ target = 13
 Output: false
 */
 
-
 /**
  * @param {number[][]} matrix
  * @param {number} target
@@ -58,17 +57,5 @@ var searchMatrixAux = function(matrix, firstRow, lastRow, target) {
 
   return false;
 };
- 
-var main = function(){
-  test();
-}
-
-var test = function() {
-  assert.equal(searchMatrix([], 0), false);
-  assert.equal(searchMatrix([[1], [3]], 3), true);
-  assert.equal(searchMatrix([[1], [3]], 1), true);
-  const matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]];
-  assert.equal(searchMatrix(matrix, 3), true);
-}
 
-module.exports.main = main;
+module.exports.searchMatrix = searchMatrix;

LeetcodeProblems/Search_a_2D_Matrix_II.js

@@ -18,7 +18,6 @@ Given target = 5, return true.
 Given target = 20, return false.
 */
 
-
 /**
 * @param {number[][]} matrix
 * @param {number} target
@@ -43,22 +42,4 @@ var searchMatrix = function(matrix, target) {
   return false;
 };
 
-const matrix1 = [
-  [1,4,7,    11,15],
-  [2,5,8,    12,19],
-  [3,6,9,    16,22],
-  [10,13,14, 17,24],
-  [18,21,23, 26,30]
-];
-
-var main = function(n) {
-  test();
-}
-
-var test = function() {
-  assert.equal(searchMatrix(matrix1, 5), true);
-  assert.equal(searchMatrix(matrix1, 0), false);
-  assert.equal(searchMatrix(matrix1, 15), true);
-}
-
-module.exports.main = main;
+module.exports.searchMatrix = searchMatrix;

LeetcodeProblems/Set_Matrix_Zeroes.js

@@ -39,8 +39,6 @@ A simple improvement uses O(m + n) space, but still not the best solution.
 Could you devise a constant space solution?
 */
 
-
-
 /**
  * @param {number[][]} matrix
  * @return {void} Do not return anything, modify matrix in-place instead.
@@ -110,15 +108,4 @@ var fillCol = function(matrix, col) {
     matrix[i][col] = 0;
 }
 
-var main = function() {
-  test();
-}
-
-var test = function() {
-  assert.deepEqual(
-    setZeroes([[1,1,1],[1,0,1],[1,1,1]]),
-    [[1, 0, 1], [0, 0, 0], [1, 0, 1]]
-  );
-}
-
-module.exports.main = main;
+module.exports.setZeroes = setZeroes;

LeetcodeProblems/Simplify_Path.js

@@ -60,17 +60,4 @@ var simplifyPath = function(path) {
   return (ret.length == 0) ? "/" : ret;
 };
 
-var main = function(){
-  test();
-}
-
-var test = function() { 
-  assert.equal(simplifyPath("/../c"), "/c");
-  assert.equal(simplifyPath("/.."), "/");
-  assert.equal(simplifyPath("/home/"), "/home"); // => "/home"
-  assert.equal(simplifyPath("/a/./b/../../c/"), "/c"); // => "/c"
-  assert.equal(simplifyPath("/a/../../b/../c//.//"), "/c"); // => "/c"
-  assert.equal(simplifyPath("/a//b////c/d//././/.."), "/a/b/c") // => "/a/b/c"
-}
-
-module.exports.main = main
+module.exports.simplifyPath = simplifyPath;

LeetcodeProblems/Spiral_Matrix.js

@@ -67,17 +67,4 @@ var printRect = function(matrix, i, rowLength, colLength, retArray) {
   }
 }
 
-var main = function() {
-  const matrix = [
-   [ 1, 2, 3 ],
-   [ 4, 5, 6 ],
-   [ 7, 8, 9 ]
-  ]
-
-  assert.deepEqual(
-    spiralOrder(matrix),
-    [1, 2, 3, 6, 9, 8, 7, 4, 5]
-  )
-}
-
-module.exports.main = main;
+module.exports.spiralOrder = spiralOrder;

LeetcodeProblems/Subarray_Sum_Equals_K.js

@@ -60,15 +60,4 @@ var subarraySum2 = function(nums, k) {
   return ret;
 };
 
-var main = function() {
-  test();
-}
-
-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;
+module.exports.subarraySum = subarraySum;

LeetcodeProblems/Subsets.js

@@ -38,21 +38,4 @@ var subsets = function(nums) {
   return subsetByPosition(nums, 0, []);
 };
 
-function main() {
-  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;
+module.exports.subsets = subsets;