Add solution #118

Author: JoshCrozier

README.md

@@ -36,6 +36,7 @@
 67|[Add Binary](./0067-add-binary.js)|Easy|
 73|[Set Matrix Zeroes](./0073-set-matrix-zeroes.js)|Medium|
 88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|
+118|[Pascal's Triangle](./0118-pascals-triangle.js)|Easy|
 121|[Best Time to Buy and Sell Stock](./0121-best-time-to-buy-and-sell-stock.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|

solutions/0118-pascals-triangle.js

@@ -0,0 +1,27 @@
+/**
+ * 118. Pascal's Triangle
+ * https://leetcode.com/problems/pascals-triangle/
+ * Difficulty: Easy
+ *
+ * Given an integer numRows, return the first numRows of Pascal's triangle.
+ *
+ * In Pascal's triangle, each number is the sum of the two numbers directly
+ * above it as shown:
+ */
+
+/**
+ * @param {number} numRows
+ * @return {number[][]}
+ */
+var generate = function(numRows) {
+  const result = [[1]];
+
+  for (let i = 1; i < numRows; i++) {
+    result[i] = [1];
+    result[i - 1].forEach((value, j, prev) => {
+      result[i][j + 1] = (prev[j + 1] + value) || 1;
+    });
+  }
+
+  return result;
+};