remove uselessrequires

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
@@ -65,4 +64,4 @@ function test() {
   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) {
@@ -128,4 +127,7 @@ function test() {
   assert.equal(deletionDistanceDP("", ""), 0);
 }
 
-module.exports.main = main
+module.exports.deletionDistance = deletionDistance;
+module.exports.deletionDistance2 = deletionDistance2;
+module.exports.deletionDistanceDP = deletionDistanceDP;
+

LeetcodeProblems/Design_Circular_Deque.js

@@ -35,7 +35,6 @@ All values will be in the range of [0, 1000].
 The number of operations will be in the range of [1, 1000].
 Please do not use the built-in Deque library.
 */
-const assert = require('assert');
 
 /**
  * Initialize your data structure here. Set the size of the deque to be k.
@@ -132,21 +131,4 @@ MyCircularDeque.prototype.isFull = function() {
   return this.queue.length === this.maxSize;
 };
 
-var main = function(){
-  test();
-};
-
-var test =  function() {
-  const obj = new MyCircularDeque(3);
-  assert.equal(obj.insertLast(1), true);
-  assert.equal(obj.insertLast(2), true);
-  assert.equal(obj.insertFront(3), true);
-  assert.equal(obj.insertFront(4), false);
-  assert.equal(obj.getRear(), 2);
-  assert.equal(obj.isFull(), true);
-  assert.equal(obj.deleteLast(), true);
-  assert.equal(obj.insertFront(4), true);
-  assert.equal(obj.getFront(), 4);
-}
-
-module.exports.main = main;
+module.exports.MyCircularDeque = MyCircularDeque;

LeetcodeProblems/Edit_Distance.js

@@ -28,7 +28,6 @@ enention -> exention (replace 'n' with 'x')
 exention -> exection (replace 'n' with 'c')
 exection -> execution (insert 'u')
 */
-const assert = require('assert');
 
 // Optimal solution
 var minDistance = function(word1, word2) {
@@ -98,16 +97,5 @@ var min = function(a, b, c) {
   return (b < c) ? b : c;
 }
 
-var main = function() {
-  test();
-}
-
-function test() {
-  assert.equal(minDistance("ros", "horse"), 3);
-  assert.equal(minDistance("intention", "execution"), 5);
-
-  assert.equal(minDistance2("ros", "horse"), 3);
-  assert.equal(minDistance2("intention", "execution"), 5);
-}
-
-module.exports.main = main;
+module.exports.minDistance = minDistance;
+module.exports.minDistance2 = minDistance2;

LeetcodeProblems/Escape_The_Ghosts.js

@@ -36,7 +36,6 @@ Note:
 All points have coordinates with absolute value <= 10000.
 The number of ghosts will not exceed 100.
 */
-const assert = require('assert');
 
 /**
  * @param {number[][]} ghosts

LeetcodeProblems/Flood_Fill.js

@@ -28,7 +28,7 @@ The length of image and image[0] will be in the range [1, 50].
 The given starting pixel will satisfy 0 <= sr < image.length and 0 <= sc < image[0].length.
 The value of each color in image[i][j] and newColor will be an integer in [0, 65535].
 */
-const assert = require('assert');
+
 
 var floodFill = function(image, sr, sc, newColor) {
   var oldColor = image[sr][sc];

LeetcodeProblems/Group_Anagrams.js

@@ -18,7 +18,7 @@ Note:
 All inputs will be in lowercase.
 The order of your output does not matter.
 */
-const assert = require('assert');
+
 
 var groupAnagrams = function(strs) {
   var ret = [];

LeetcodeProblems/Implement_stack_using_queues.js

@@ -23,7 +23,7 @@ You must use only standard operations of a queue -- which means only push to bac
 Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
 You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
 */
-const assert = require('assert');
+
 class MyStack  {
   constructor() {
     this.q1 = [];

LeetcodeProblems/Kth_Largest_Element_in_an_Array.js

@@ -15,7 +15,7 @@ Output: 4
 Note: 
 You may assume k is always valid, 1 ≤ k ≤ array's length.
 */
-const assert = require('assert');
+
 
 /**
  * @param {number[]} nums

LeetcodeProblems/Linked_List_Cycle_II.js

@@ -9,7 +9,7 @@ Note: Do not modify the linked list.
 Follow up:
 Can you solve it without using extra space?
 */
-const assert = require('assert');
+
 var ListNode = require('../UtilsClasses/ListNode').ListNode;
 
 // Optimal solution

LeetcodeProblems/Longest_Consecutive_Sequence.js

@@ -12,7 +12,7 @@ Input: [100, 4, 200, 1, 3, 2]
 Output: 4
 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
 */
-const assert = require('assert');
+
 
 /**
  * @param {number[]} nums

LeetcodeProblems/Longest_Palindromic_Substring.js

@@ -14,7 +14,7 @@ Example 2:
 Input: "cbbd"
 Output: "bb"
 */
-const assert = require('assert');
+
 
 /**
  * @param {string} s

LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js

@@ -33,7 +33,7 @@ Note:
 All of the nodes' values will be unique.
 p and q are different and both values will exist in the binary tree.
 */
-const assert = require('assert');
+
 
 var TreeNode = require('../UtilsClasses/TreeNode').TreeNode;