On it

Author: ignacio-chiazzo

LeetcodeProblems/Swap_Nodes_In_Pairs.js

@@ -12,8 +12,9 @@ Note:
 Your algorithm should use only constant extra space.
 You may not modify the values in the list's nodes, only nodes itself may be changed.
 */
-
-var ListNode = require('../UtilsClasses/ListNode').ListNode;
+const assert = require('assert');
+const ListNode = require('../UtilsClasses/ListNode').ListNode;
+const ListNodeTestHelper = require('../utilsClasses/ListNodeTestHelper');
 
 /**
  * Definition for singly-linked list.
@@ -49,10 +50,17 @@ var swapPairs = function(head) {
 };
 
 var main = function() {
-  console.log(swapPairs(ListNode.linkenList([1,2,3,4])));
-  console.log(swapPairs(ListNode.linkenList([])));
-  console.log(swapPairs(ListNode.linkenList([1])));
-  console.log(swapPairs(ListNode.linkenList([1,2])));
+
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([2])), [2, 3]);
+  test();
+}
+
+var test = function () {
+  // TODOOOOOOOOOO
+  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2,3,4])), [2,1,4,3]);
+  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([])), []);
+  // ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1])), [1]);
+  ListNodeTestHelper.assertList(swapPairs(ListNode.linkenList([1,2])), [2, 3]);
 }
 
 module.exports.main = main;

LeetcodeProblems/Tic_Tac_Toe.js

@@ -67,35 +67,20 @@ var main = function() {
 module.exports.main = main;
 
 ticTacToe = new TicTacToe();
-// ticTacToe.isBoardFull();
-// ticTacToe.addToken(0,1,"X");
-// ticTacToe.printBoard();
-// var iter = 0;
-// while(iter < 8) {
-//   ticTacToe.makeMove();
-//   iter++;
-// }
-
-// console.log("after 8 moves");
-// ticTacToe.isBoardFull();
-// ticTacToe.printBoard();
-// ticTacToe.makeMove();
-
-// ticTacToe.printBoard();
-// ticTacToe.addToken(0,0,"X");
-// ticTacToe.printBoard();
-
-
-
-// // var readline = require('readline')
-
-// // const rl = readline.createInterface({
-// //   input: process.stdin,
-// //   output: process.stdout
-// // });
+ticTacToe.isBoardFull();
+ticTacToe.addToken(0,1,"X");
+ticTacToe.printBoard();
+var iter = 0;
+while(iter < 8) {
+  ticTacToe.makeMove();
+  iter++;
+}
 
-// // var response = rl.question('Whats your name : ', answer)
+console.log("after 8 moves");
+ticTacToe.isBoardFull();
+ticTacToe.printBoard();
+ticTacToe.makeMove();
 
-// // function answer(response) {
-// //     console.log(response)
-// // }
+ticTacToe.printBoard();
+ticTacToe.addToken(0,0,"X");
+ticTacToe.printBoard();

LeetcodeProblems/Unique_Binary_Search_Trees.js

@@ -22,7 +22,7 @@ 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');
+const assert = require('assert');
 
 // Solution 3 using DP
 var numTrees3 = function (n) {

LeetcodeProblems/Unique_Paths.js

@@ -26,7 +26,7 @@ Output: 28
 
 // Solution 1
 // This solution is a naive solution implementing a binary tree and visiting each node.
-var assert = require('assert');
+const assert = require('assert');
 
 var uniquePaths1 = function(m, n) {
   return uniquePathsAux(0, 0, m, n)

LeetcodeProblems/Valid_Parentheses.js

@@ -32,7 +32,7 @@ Input: "{[]}"
 Output: true
 */
 
-var assert = require('assert');
+const assert = require('assert');
 
 var isValid = function(s) {
   var stack = [];

LeetcodeProblems/Verify_Preorder_Serialization_of_a_Binary_Tree.js

@@ -31,7 +31,7 @@ Example 3:
 Input: "9,#,#,1"
 Output: false
 */
-var assert = require('assert');
+const assert = require('assert');
 
 /**
  * @param {string} preorder

utilsClasses/ListNode.js

@@ -10,13 +10,24 @@ class ListNode {
 
     var first = new ListNode(arr[0]);
     var head = first;
-    for(var i = 1; i <= arr.length; i++) {
+    for(var i = 1; i < arr.length; i++) {
       head.next = new ListNode(arr[i]);
       head = head.next;
     }
 
     return first;
   }
+
+  length() {
+    var list = this;
+    var size = 0;
+    while(list) {
+      list = list.next;
+      size++;
+    }
+
+    return size;
+  }
 }
 
 module.exports.ListNode = ListNode;

utilsClasses/ListNodeTestHelper.js

@@ -0,0 +1,13 @@
+const assert = require('assert');
+
+var assertList = function(list, expectedArr) {
+  assert.strictEqual(list.length(), expectedArr.length);
+  for(var i = 0; i < expectedArr.length; i++) {
+    assert.strictEqual(list.val, expectedArr[i]);
+    list = list.next;
+  }
+
+  assert(list)
+}
+
+module.exports.assertList = assertList;