Added utils class

Author: ignacio-chiazzo

LeetcodeProblems/Add_Two_Numbers.js

@@ -2,7 +2,8 @@
 Add Two Numbers
 https://leetcode.com/problems/add-two-numbers/
 
-You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order 
+and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
 
 You may assume the two numbers do not contain any leading zero, except the number 0 itself.
 
@@ -20,16 +21,19 @@ Explanation: 342 + 465 = 807.
  *     this.next = null;
  * }
  */
+
+var ListNode = require('../utilsClasses/ListNode').ListNode;
+ 
 /**
  * @param {ListNode} l1
  * @param {ListNode} l2
  * @return {ListNode}
  */
-    
+
 var addTwoNumbers = function(l1, l2) {
-  if(l1 === null) {
+  if(l1 === null)
     return (l2 === null) ? new ListNode(0) : l2;
-  } else if(l2 === null)
+  else if(l2 === null)
     return l1;  
 
   var elem = l1.val + l2.val;
@@ -62,3 +66,12 @@ var addTwoNumbers = function(l1, l2) {
   }
   return head;
 };
+
+
+var main = function() {
+  const list1 = ListNode.linkenList([1,2,3,4]);
+  const list2 = ListNode.linkenList([1,2,3,4]);
+  console.log(addTwoNumbers(list1, list2));
+}
+
+main();

LeetcodeProblems/BinaryGap.js

@@ -1,4 +1,5 @@
 /*
+Binary Gap
 https://leetcode.com/problems/binary-gap/description/
 
 Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N.

Main.js

@@ -9,6 +9,7 @@ var main = async function() {
     for(i in problems) { 
       console.log("Solving: " + problems[i] + ":");
       const problem = require(PROBLEMS_FOLDER + problems[i]);
+
       if (typeof(problem.main) !=='undefined') {
         problem.main();
         console.log("End of the solution for : " + problems[i] + ",\n\n");

utilsClasses/ListNode.js

@@ -0,0 +1,22 @@
+class ListNode {
+  constructor(val) {
+    this.val = val;
+    this.next = null;
+  }
+
+  static linkenList(arr) {
+    if(arr.length === 0)
+      return null;
+    
+    var first = new ListNode(arr[0]);
+    var head = first;
+    for(var i = 1; i <= arr.length; i++) {
+      head.next = new ListNode(arr[i]);
+      head = head.next;
+    }
+
+    return first;
+  }
+}
+
+module.exports.ListNode = ListNode;