Merge pull request #1 from loiane/master

Merging changes from head/master to my github base/master directly.

Author: shoredata

.eslintrc.json

@@ -32,6 +32,8 @@
     "prefer-destructuring": ["error", {"object": true, "array": false}],
     "padded-blocks": 0,
     "no-sparse-arrays": 0,
-    "array-bracket-spacing": 0
+    "array-bracket-spacing": 0,
+    "import/no-named-as-default": 0,
+    "implicit-arrow-linebreak": 0
   }
 }

README.md

@@ -1,7 +1,7 @@
 Learning JavaScript Data Structures and Algorithms
 ====================================
 
-[![Build Status](https://travis-ci.org/loiane/javascript-datastructures-algorithms.svg?branch=third-edition)](https://travis-ci.org/loiane/javascript-datastructures-algorithms)
+[![Build Status](https://travis-ci.org/loiane/javascript-datastructures-algorithms.svg?branch=master)](https://travis-ci.org/loiane/javascript-datastructures-algorithms)
 [![codecov](https://codecov.io/gh/loiane/javascript-datastructures-algorithms/branch/master/graph/badge.svg)](https://codecov.io/gh/loiane/javascript-datastructures-algorithms)
 [![devDependencies Status](https://david-dm.org/loiane/javascript-datastructures-algorithms/dev-status.svg)](https://david-dm.org/loiane/javascript-datastructures-algorithms?type=dev)
 [![dependencies Status](https://david-dm.org/loiane/javascript-datastructures-algorithms/status.svg)](https://david-dm.org/loiane/javascript-datastructures-algorithms)
@@ -82,7 +82,7 @@ Happy Coding!
 
 | 1st edition   | 2nd edition   | 3rd edition   | 
 | ------------- |:-------------:|:-------------:| 
-| ![1st edition](https://d1ldz4te4covpm.cloudfront.net/sites/default/files/imagecache/ppv4_main_book_cover/4874OS_Learning%20JavaScript%20Data%20Structures%20and%20Algorithms.jpg)      | ![2nd edition](https://d255esdrn735hr.cloudfront.net/sites/default/files/imagecache/ppv4_main_book_cover/5493OS_5348_Learning%20JavaScript%20Data%20Structures%20and%20Algorithms,%20Second%20Edition.jpg) | ![3rd edition](https://d1ldz4te4covpm.cloudfront.net/sites/default/files/imagecache/ppv4_main_book_cover/B09377.png) |
+| ![1st edition](https://images-na.ssl-images-amazon.com/images/I/51xXGv7QlBL._SX403_BO1,204,203,200_.jpg)      | ![2nd edition](https://images-na.ssl-images-amazon.com/images/I/51PWJ%2BoKc2L._SX403_BO1,204,203,200_.jpg) | ![3rd edition](https://images-na.ssl-images-amazon.com/images/I/41oSXp3VztL._SX404_BO1,204,203,200_.jpg) |
 | [Book link](http://amzn.to/1Y1OWPx)| [Book link](http://amzn.to/1TSkcA1)| [Book link](http://a.co/cbMlYmJ)|
 
 Book link - first edition:
@@ -100,6 +100,8 @@ Book link - second edition:
  Book link - third edition:
  - [Packt](https://www.packtpub.com/web-development/learning-javascript-data-structures-and-algorithms-third-edition)
  - [Amazon](http://a.co/cbMlYmJ)
+ - [Chinese version](http://www.ituring.com.cn/book/2653)
+ - [Brazilian Portuguese version](https://novatec.com.br/livros/estruturas-de-dados-algoritmos-em-javascript-2ed/)
 
 ### Found an issue or have a question?
 

package-lock.json

@@ -21,6 +21,7 @@
     "lint:js": "eslint src/js && eslint test/js",
     "lint:ts": "tslint -c tslint.json 'src/ts/**/*.ts' && tslint -c tslint.json 'test/ts/**/*.ts'",
     "lint": "npm run lint:js && npm run lint:ts",
+    "eslintFix": "eslint src/js --fix && eslint test/js --fix",
     "test:js": "mocha --compilers js:babel-core/register ./test/js  --recursive --reporter mochawesome",
     "test:ts": "mocha -r ts-node/register ./test/ts/**/*.spec.ts ./test/ts/**/**/*.spec.ts --recursive",
     "test": "npm run test:js && npm run test:ts",
@@ -57,27 +58,27 @@
     "@types/chai": "^4.1.2",
     "@types/mocha": "^5.0.0",
     "babel-cli": "^6.26.0",
-    "babel-core": "^6.26.0",
-    "babel-eslint": "^8.2.2",
-    "babel-loader": "^7.1.4",
-    "babel-plugin-add-module-exports": "^0.2.1",
+    "babel-core": "^6.26.3",
+    "babel-eslint": "^10.0.1",
+    "babel-loader": "^8.0.5",
+    "babel-plugin-add-module-exports": "^1.0.0",
     "babel-plugin-transform-es2015-modules-umd": "^6.24.1",
-    "babel-preset-env": "^1.6.1",
+    "babel-preset-env": "^1.7.0",
     "chai": "^4.1.2",
-    "codecov": "^3.0.0",
-    "eslint": "^4.18.2",
-    "eslint-config-airbnb-base": "^12.1.0",
-    "eslint-plugin-import": "^2.9.0",
+    "codecov": "^3.2.0",
+    "eslint": "^5.15.1",
+    "eslint-config-airbnb-base": "^13.1.0",
+    "eslint-plugin-import": "^2.16.0",
     "istanbul": "^v1.1.0-alpha.1",
     "mocha": "^5.0.4",
     "mochawesome": "^3.0.2",
     "nyc": "11.7.2",
-    "ts-node": "^5.0.1",
-    "tslint": "^5.9.1",
-    "typescript": "^2.7.2",
-    "webpack": "^4.1.1",
-    "webpack-cli": "2.1.1",
-    "yargs": "^11.0.0"
+    "ts-node": "8.0.3",
+    "tslint": "5.14.0",
+    "typescript": "3.3.3333",
+    "webpack": "^4.29.6",
+    "webpack-cli": "3.3.0",
+    "yargs": "13.2.2"
   },
   "dependencies": {
     "http-server": "^0.11.1"

package.json

@@ -31,9 +31,9 @@ function usedInBox(matrix, boxStartRow, boxStartCol, num) {
 
 function isSafe(matrix, row, col, num) {
   return (
-    !usedInRow(matrix, row, num) &&
-    !usedInCol(matrix, col, num) &&
-    !usedInBox(matrix, row - (row % 3), col - (col % 3), num)
+    !usedInRow(matrix, row, num)
+    && !usedInCol(matrix, col, num)
+    && !usedInBox(matrix, row - (row % 3), col - (col % 3), num)
   );
 }
 function solveSudoku(matrix) {

src/js/algorithms/backtracking/sudoku-solver.js

@@ -43,4 +43,3 @@ export function matrixChainOrder(p) {
   printOptimalParenthesis(s, 1, n - 1);
   return m[1][n - 1];
 }
-

src/js/algorithms/dynamic-programing/matrix-chain-multiplication.js

@@ -18,9 +18,9 @@ export function minCoinChange(coins, amount) {
         newMin = makeChange(newAmount);
       }
       if (
-        newAmount >= 0 &&
-        (newMin.length < min.length - 1 || !min.length) &&
-        (newMin.length || !newAmount)
+        newAmount >= 0
+        && (newMin.length < min.length - 1 || !min.length)
+        && (newMin.length || !newAmount)
       ) {
         min = [coin].concat(newMin);
         // console.log('new Min ' + min + ' for ' + amount);

src/js/algorithms/dynamic-programing/min-coin-change.js

@@ -4,8 +4,8 @@ export function matrixChainOrder(p, i = 1, j = p.length - 1) {
   }
   let min = Number.MAX_SAFE_INTEGER;
   for (let k = i; k < j; k++) {
-    const count =
-      matrixChainOrder(p, i, k) + matrixChainOrder(p, k + 1, j) + ((p[i - 1] * p[k]) * p[j]);
+    const count = matrixChainOrder(p, i, k)
+      + matrixChainOrder(p, k + 1, j) + ((p[i - 1] * p[k]) * p[j]);
     if (count < min) {
       min = count;
     }

src/js/algorithms/greedy/matrix-chain-multiplication.js

@@ -21,9 +21,9 @@ export function interpolationSearch(
   let position = -1;
   let delta = -1;
   while (
-    low <= high &&
-    biggerEquals(value, array[low], compareFn) &&
-    lesserEquals(value, array[high], compareFn)
+    low <= high
+    && biggerEquals(value, array[low], compareFn)
+    && lesserEquals(value, array[high], compareFn)
   ) {
     delta = diffFn(value, array[low]) / diffFn(array[high], array[low]);
     position = low + Math.floor((high - low) * delta);

src/js/algorithms/search/interpolation-search.js

@@ -16,12 +16,14 @@ export default class AVLTree extends BinarySearchTree {
     this.compareFn = compareFn;
     this.root = null;
   }
+
   getNodeHeight(node) {
     if (node == null) {
       return -1;
     }
     return Math.max(this.getNodeHeight(node.left), this.getNodeHeight(node.right)) + 1;
   }
+
   /**
    * Left left case: rotate right
    *
@@ -39,6 +41,7 @@ export default class AVLTree extends BinarySearchTree {
     tmp.right = node;
     return tmp;
   }
+
   /**
    * Right right case: rotate left
    *
@@ -56,6 +59,7 @@ export default class AVLTree extends BinarySearchTree {
     tmp.left = node;
     return tmp;
   }
+
   /**
    * Left right case: rotate left then right
    * @param node Node<T>
@@ -64,6 +68,7 @@ export default class AVLTree extends BinarySearchTree {
     node.left = this.rotationRR(node.left);
     return this.rotationLL(node);
   }
+
   /**
    * Right left case: rotate right then left
    * @param node Node<T>
@@ -72,6 +77,7 @@ export default class AVLTree extends BinarySearchTree {
     node.right = this.rotationLL(node.right);
     return this.rotationRR(node);
   }
+
   getBalanceFactor(node) {
     const heightDifference = this.getNodeHeight(node.left) - this.getNodeHeight(node.right);
     switch (heightDifference) {
@@ -87,13 +93,15 @@ export default class AVLTree extends BinarySearchTree {
         return BalanceFactor.BALANCED;
     }
   }
+
   insert(key) {
     this.root = this.insertNode(this.root, key);
   }
+
   insertNode(node, key) {
     if (node == null) {
       return new Node(key);
-    } else if (this.compareFn(key, node.key) === Compare.LESS_THAN) {
+    } if (this.compareFn(key, node.key) === Compare.LESS_THAN) {
       node.left = this.insertNode(node.left, key);
     } else if (this.compareFn(key, node.key) === Compare.BIGGER_THAN) {
       node.right = this.insertNode(node.right, key);
@@ -122,6 +130,7 @@ export default class AVLTree extends BinarySearchTree {
     }
     return node;
   }
+
   removeNode(node, key) {
     node = super.removeNode(node, key); // {1}
     if (node == null) {
@@ -132,8 +141,8 @@ export default class AVLTree extends BinarySearchTree {
     if (balanceFactor === BalanceFactor.UNBALANCED_LEFT) {
       // Left left case
       if (
-        this.getBalanceFactor(node.left) === BalanceFactor.BALANCED ||
-        this.getBalanceFactor(node.left) === BalanceFactor.SLIGHTLY_UNBALANCED_LEFT
+        this.getBalanceFactor(node.left) === BalanceFactor.BALANCED
+        || this.getBalanceFactor(node.left) === BalanceFactor.SLIGHTLY_UNBALANCED_LEFT
       ) {
         return this.rotationLL(node);
       }
@@ -145,8 +154,8 @@ export default class AVLTree extends BinarySearchTree {
     if (balanceFactor === BalanceFactor.UNBALANCED_RIGHT) {
       // Right right case
       if (
-        this.getBalanceFactor(node.right) === BalanceFactor.BALANCED ||
-        this.getBalanceFactor(node.right) === BalanceFactor.SLIGHTLY_UNBALANCED_RIGHT
+        this.getBalanceFactor(node.right) === BalanceFactor.BALANCED
+        || this.getBalanceFactor(node.right) === BalanceFactor.SLIGHTLY_UNBALANCED_RIGHT
       ) {
         return this.rotationRR(node);
       }