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

Author: taryn2016

README.md

@@ -81,7 +81,7 @@
 | [110][110-question] | [Balanced Binary Tree][110-tips]                             | [Easy][E]   | [✅][110-java] | [✅][110-js] | [✅][110-kotlin] |
 | [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-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] |
 | [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] |
@@ -461,6 +461,7 @@ commit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``
 [110-js]: ./src/_110/Solution.js
 [111-js]: ./src/_111/Solution.js
 [112-js]: ./src/_112/Solution.js
+[118-js]: ./src/_118/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_118/Solution.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number} numRows
+ * @return {number[][]}
+ */
+var generate = 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
+};

tips/118/README.md

@@ -69,6 +69,28 @@ class Solution {
 }
 ```
 
+```JavaScript
+var generate = 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
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]