feat: add solution of Pascals Triangle II(119) with javascript.

Author: taryn2016

README.md

@@ -82,7 +82,7 @@
 | [111][111-question] | [Minimum Depth of Binary Tree][111-tips]                     | [Easy][E]   | [✅][111-java] | [✅][111-js] | [✅][111-kotlin] |
 | [112][112-question] | [Path Sum][112-tips]                                         | [Easy][E]   | [✅][112-java] | [✅][112-js] | [✅][112-kotlin] |
 | [118][118-question] | [Pascal's Triangle][118-tips]                                | [Easy][E]   | [✅][118-java] | [✅][118-js] | [✅][118-kotlin] |
-| [119][119-question] | [Pascal's Triangle II][119-tips]                             | [Easy][E]   | [✅][119-java] |              | [✅][119-kotlin] |
+| [119][119-question] | [Pascal's Triangle II][119-tips]                             | [Easy][E]   | [✅][119-java] | [✅][119-js]| [✅][119-kotlin] |
 | [121][121-question] | [Best Time to Buy and Sell Stock][121-tips]                  | [Easy][E]   | [✅][121-java] |              | [✅][121-kotlin] |
 | [122][122-question] | [Best Time to Buy and Sell Stock II][122-tips]               | [Easy][E]   | [✅][122-java] |              | [✅][122-kotlin] |
 | [125][125-question] | [Valid Palindrome][125-tips]                                 | [Easy][E]   |                |              | [✅][125-kotlin] |
@@ -462,6 +462,7 @@ commit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``
 [111-js]: ./src/_111/Solution.js
 [112-js]: ./src/_112/Solution.js
 [118-js]: ./src/_118/Solution.js
+[119-js]: ./src/_119/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_119/Solution.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number} rowIndex
+ * @return {number[]}
+ */
+var getRow = function(rowIndex) {
+  var rowArr = function(numRows) {
+      let arr = []
+      for(var i = 1; i <= numRows; i++) {
+          if(i === 1) {
+            arr.push([1])
+            continue
+          }
+          if(i === 2) {
+            arr.push([1, 1])
+            continue
+          }
+          let innerArr = [1]
+          for(var j = 2; j < i; j++) {
+            innerArr.push(arr[i-2][j-2] + arr[i-2][j-1])
+          }
+          innerArr.push(1)
+          arr.push(innerArr)
+        }
+        return arr
+  }
+  return rowArr(rowIndex + 1)[rowIndex]
+};

tips/101/README.md

@@ -78,7 +78,7 @@ class Solution {
 }
 ```
 
-
+JavaScript：
 ```javascript
 var isSymmetric = function(root) {
     if(root == null) return true

tips/104/README.md

@@ -44,6 +44,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```javascript
 var maxDepth = function(root) {
     if (root == null) return 0;

tips/107/README.md

@@ -119,6 +119,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```javascript
 var levelOrderBottom = function(root) {
     if (root === null) { return []; }

tips/108/README.md

@@ -85,6 +85,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```javascript
 var sortedArrayToBST = function(nums) {
   if (nums == null || !nums.length) {

tips/110/README.md

@@ -59,7 +59,8 @@ class Solution {
 ```
 
 
-```
+JavaScript：
+```JavaScript
 var isBalanced = function(root) {
   if(root == null) return true
   var treeDeep = function(root) {

tips/111/README.md

@@ -48,6 +48,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```JavaScript
 var minDepth = function(root) {
   if(root == null) return 0

tips/112/README.md

@@ -58,6 +58,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```JavaScript
 var hasPathSum = function(root, sum) {
   if(root == null) {

tips/118/README.md

@@ -69,6 +69,7 @@ class Solution {
 }
 ```
 
+JavaScript：
 ```JavaScript
 var generate = function(numRows) {
   let arr = []

tips/119/README.md

@@ -54,6 +54,32 @@ class Solution {
 }
 ```
 
+JavaScript：
+```JavaScript
+var getRow = function(rowIndex) {
+  var rowArr = function(numRows) {
+      let arr = []
+      for(var i = 1; i <= numRows; i++) {
+          if(i === 1) {
+            arr.push([1])
+            continue
+          }
+          if(i === 2) {
+            arr.push([1, 1])
+            continue
+          }
+          let innerArr = [1]
+          for(var j = 2; j < i; j++) {
+            innerArr.push(arr[i-2][j-2] + arr[i-2][j-1])
+          }
+          innerArr.push(1)
+          arr.push(innerArr)
+        }
+        return arr
+  }
+  return rowArr(rowIndex + 1)[rowIndex]
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]