Add solution #120

Author: JoshCrozier

README.md

@@ -70,6 +70,7 @@
 116|[Populating Next Right Pointers in Each Node](./0116-populating-next-right-pointers-in-each-node.js)|Medium|
 118|[Pascal's Triangle](./0118-pascals-triangle.js)|Easy|
 119|[Pascal's Triangle II](./0119-pascals-triangle-ii.js)|Easy|
+120|[Triangle](./0120-triangle.js)|Medium|
 121|[Best Time to Buy and Sell Stock](./0121-best-time-to-buy-and-sell-stock.js)|Easy|
 128|[Longest Consecutive Sequence](./0128-longest-consecutive-sequence.js)|Medium|
 133|[Clone Graph](./0133-clone-graph.js)|Medium|

solutions/0120-triangle.js

@@ -0,0 +1,25 @@
+/**
+ * 120. Triangle
+ * https://leetcode.com/problems/triangle/
+ * Difficulty: Medium
+ *
+ * Given a triangle array, return the minimum path sum from top to bottom.
+ *
+ * For each step, you may move to an adjacent number of the row below. More
+ * formally, if you are on index i on the current row, you may move to either
+ * index i or index i + 1 on the next row.
+ */
+
+/**
+ * @param {number[][]} triangle
+ * @return {number}
+ */
+var minimumTotal = function(triangle) {
+  for (let i = triangle.length - 2; i > -1; i--) {
+    for (let j = 0; j < triangle[i].length; j++) {
+      triangle[i][j] += Math.min( triangle[i + 1][j], triangle[i + 1][j + 1]);
+    }
+  }
+
+  return triangle[0][0];
+};