Create 120. Triangle (#896)

Author: Chayandas07

120. Triangle

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int minimumTotal(vector<vector<int>>& triangle) {
+        int n = triangle.size();
+        vector<vector<int>> dp(triangle.begin(), triangle.end());
+        for (int i = n-2; i >= 0; i--) {
+            for (int k = 0; k <= i; k++) {
+                dp[i][k] += min(dp[i+1][k], dp[i+1][k+1]);
+            }
+        }
+        return dp[0][0];
+    }
+};