add sol 120

Author: ductnn

leetcode/daily/120/sol.go

@@ -0,0 +1,33 @@
+// https://leetcode.com/problems/triangle
+
+package main
+
+import "fmt"
+
+func minimumTotal(triangle [][]int) int {
+	n := len(triangle)
+	dp := make([][]int, n)
+	for i := 0; i < n; i++ {
+		dp[i] = make([]int, len(triangle[i]))
+		copy(dp[i], triangle[i])
+	}
+
+	for i := n - 2; i >= 0; i-- {
+		for j := 0; j <= i; j++ {
+			dp[i][j] += min(dp[i+1][j], dp[i+1][j+1])
+		}
+	}
+	return dp[0][0]
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func main() {
+	triangle := [][]int{{2}, {3, 4}, {6, 5, 7}, {4, 1, 8, 3}}
+	fmt.Println(minimumTotal(triangle))
+}

leetcode/daily/120/sol.py

@@ -0,0 +1,19 @@
+# https://leetcode.com/problems/triangle
+
+from typing import List
+
+class Solution:
+    def minimumTotal(self, triangle: List[List[int]]) -> int:
+        n = len(triangle)
+
+        # bottom up
+        for i in range(n-2, -1, -1):
+            for j in range(i+1):
+                triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1])
+                print(triangle)
+
+        return triangle[0][0]
+
+if __name__ == "__main__":
+    triangle = [[2], [3, 4], [6, 5, 7], [4, 1, 8, 3]]
+    print(Solution().minimumTotal(triangle))