formated with vscode prettier plugin

Author: dalindev

Diff for: 119__easy__pascals_triangle_ii.js

@@ -3,22 +3,22 @@
  * @return {number[]}
  */
 var getRow = function(rowIndex) {
-    let res = new Array(rowIndex+1).fill(0);
-    res[0] = 1;
-    /*
+  let res = new Array(rowIndex + 1).fill(0);
+  res[0] = 1;
+  /*
             1
            1,1
           1,2,1
          1,3,3,1
         1,4,6,4,1
     */
-    for (let i = 0; i < res.length; i++) {
-        for (let j = i; j > 0; j--) {
-            if (j === i) res[j] = 1;
-            else {
-                res[j] = res[j] + res[j-1];
-            }
-        }
+  for (let i = 0; i < res.length; i++) {
+    for (let j = i; j > 0; j--) {
+      if (j === i) res[j] = 1;
+      else {
+        res[j] = res[j] + res[j - 1];
+      }
     }
-    return res;
+  }
+  return res;
 };

Diff for: 134__medium__binary-tree-inorder-traversal.js

@@ -16,7 +16,6 @@
 
 */
 
-
 /**
  * Recursive
  * O(n) time
@@ -25,23 +24,22 @@
  * 2m
  */
 var inorderTraversal = function(root) {
-    let res = [];
+  let res = [];
 
-    if (!root) return res;
+  if (!root) return res;
 
-    const inorder = (node) => {
-        if (!node) return;
+  const inorder = node => {
+    if (!node) return;
 
-        inorder(node.left);
-        res.push(node.val);
-        inorder(node.right);
-    }
+    inorder(node.left);
+    res.push(node.val);
+    inorder(node.right);
+  };
 
-    inorder(root);
-    return res;
+  inorder(root);
+  return res;
 };
 
-
 /**
  * Using Stack
  * O(n) time
@@ -50,20 +48,20 @@ var inorderTraversal = function(root) {
  * 25m
  */
 var inorderTraversal = function(root) {
-    if (!root) return [];
+  if (!root) return [];
 
-    let res = [];
-    let st = [];
-    let curr = root;
+  let res = [];
+  let st = [];
+  let curr = root;
 
-    while (curr || st.length > 0) {
-        while (curr) {
-            st.push(curr);
-            curr = curr.left;
-        }
-        curr = st.pop();
-        res.push(curr.val);
-        curr = curr.right;
+  while (curr || st.length > 0) {
+    while (curr) {
+      st.push(curr);
+      curr = curr.left;
     }
-    return res;
+    curr = st.pop();
+    res.push(curr.val);
+    curr = curr.right;
+  }
+  return res;
 };

Diff for: 136__easy__single-number.js

@@ -2,15 +2,15 @@
  * @param {number[]} nums
  * @return {number}
  */
- /**
+/**
  *
  * O(n) time
  * O(1) space
  *
  * 4m
  */
 var singleNumber = function(nums) {
-    let res = 0;
-    nums.forEach( n => res ^= n);
-    return res;
-};
+  let res = 0;
+  nums.forEach(n => (res ^= n));
+  return res;
+};

Diff for: 144__medium__binary-tree-preorder-traversal.js

@@ -26,20 +26,18 @@
  * 3m
  */
 var preorderTraversal = function(root) {
-    let res = [];
-    const preorder = (node) => {
-        if (!node) return;
+  let res = [];
+  const preorder = node => {
+    if (!node) return;
 
-        res.push(node.val);
-        preorder(node.left);
-        preorder(node.right);
-    }
-    preorder(root);
-    return res;
+    res.push(node.val);
+    preorder(node.left);
+    preorder(node.right);
+  };
+  preorder(root);
+  return res;
 };
 
-
-
 /**
  *
  * using Stack
@@ -50,17 +48,17 @@ var preorderTraversal = function(root) {
  * 3m
  */
 var preorderTraversal = function(root) {
-    if (!root) return [];
+  if (!root) return [];
 
-    let res = [];
-    let st = [root];
+  let res = [];
+  let st = [root];
 
-    while (st.length > 0) {
-        let node = st.pop();
-        res.push(node.val);
-        if (node.right) st.push(node.right);
-        if (node.left) st.push(node.left);
-    }
+  while (st.length > 0) {
+    let node = st.pop();
+    res.push(node.val);
+    if (node.right) st.push(node.right);
+    if (node.left) st.push(node.left);
+  }
 
-    return res;
+  return res;
 };

Diff for: 145__hard__binary-tree-postorder-traversal.js

@@ -16,7 +16,6 @@
 
 */
 
-
 /**
  * Recursive
  * O(n) time
@@ -25,41 +24,40 @@
  * 3m
  */
 var postorderTraversal = function(root) {
-    if (!root) return [];
+  if (!root) return [];
 
-    let res = [];
-    const postorder = (node) => {
-        if (!node) return;
+  let res = [];
+  const postorder = node => {
+    if (!node) return;
 
-        postorder(node.left);
-        postorder(node.right);
-        res.push(node.val);
-    }
-    postorder(root);
-    return res;
+    postorder(node.left);
+    postorder(node.right);
+    res.push(node.val);
+  };
+  postorder(root);
+  return res;
 };
 
-
 /**
  * Using Stack
  * O(n) time
  * O(n) space
  *
  * 15m
  */
- var postorderTraversal = function(root) {
-    let res = [];
-    let st = [];
+var postorderTraversal = function(root) {
+  let res = [];
+  let st = [];
 
-    if (!root) return res;
-    st.push(root);
-    while (st.length > 0) {
-        let node = st.pop();
-        res.unshift(node.val);
-        if (node.left) st.push(node.left);
-        if (node.right) st.push(node.right);
-    }
-    return res;
+  if (!root) return res;
+  st.push(root);
+  while (st.length > 0) {
+    let node = st.pop();
+    res.unshift(node.val);
+    if (node.left) st.push(node.left);
+    if (node.right) st.push(node.right);
+  }
+  return res;
 };
 
 /**
@@ -70,16 +68,16 @@ var postorderTraversal = function(root) {
  * 15m
  */
 var postorderTraversal = function(root) {
-    let res = [];
-    let st = [];
+  let res = [];
+  let st = [];
 
-    if (!root) return res;
-    st.push(root);
-    while (st.length > 0) {
-        let node = st.pop();
-        res.push(node.val);
-        if (node.left) st.push(node.left);
-        if (node.right) st.push(node.right);
-    }
-    return res.reverse();
-};
+  if (!root) return res;
+  st.push(root);
+  while (st.length > 0) {
+    let node = st.pop();
+    res.push(node.val);
+    if (node.left) st.push(node.left);
+    if (node.right) st.push(node.right);
+  }
+  return res.reverse();
+};

Diff for: 151__medium__reverse_words_in_a_string.js

@@ -10,14 +10,14 @@
  *
  */
 var reverseWords = function(str) {
-    str = str.trim().replace(/\s\s+/g, ' ');
-    str = str.split(' ');
-    let lo = 0;
-    let hi = str.length - 1;
-    while (lo < hi) {
-        [str[lo], str[hi]] = [str[hi], str[lo]];
-        lo++;
-        hi--;
-    }
-    return str.join(' ');
+  str = str.trim().replace(/\s\s+/g, " ");
+  str = str.split(" ");
+  let lo = 0;
+  let hi = str.length - 1;
+  while (lo < hi) {
+    [str[lo], str[hi]] = [str[hi], str[lo]];
+    lo++;
+    hi--;
+  }
+  return str.join(" ");
 };

Diff for: 170__easy__two-sum-iii-data-structure-design.js

@@ -35,11 +35,11 @@
  *
  */
 
- /**
+/**
  * Initialize your data structure here.
  */
 var TwoSum = function() {
-    this.hm = new Map();
+  this.hm = new Map();
 };
 
 /**
@@ -48,7 +48,7 @@ var TwoSum = function() {
  * @return {void}
  */
 TwoSum.prototype.add = function(number) {
-    this.hm.set(number, (this.hm.get(number) || 0) + 1);
+  this.hm.set(number, (this.hm.get(number) || 0) + 1);
 };
 
 /**
@@ -57,13 +57,13 @@ TwoSum.prototype.add = function(number) {
  * @return {boolean}
  */
 TwoSum.prototype.find = function(value) {
-    for (let item of this.hm) {
-        let target = value - item[0];
-        if (this.hm.has(target)) {
-            if (target !== item[0] || this.hm.get(target) > 1) return true;
-        }
+  for (let item of this.hm) {
+    let target = value - item[0];
+    if (this.hm.has(target)) {
+      if (target !== item[0] || this.hm.get(target) > 1) return true;
     }
-    return false;
+  }
+  return false;
 };
 
 /**
@@ -72,5 +72,3 @@ TwoSum.prototype.find = function(value) {
  * obj.add(number)
  * var param_2 = obj.find(value)
  */
-
-