新题目

Author: wuyinjun

120. 三角形最小路径和/Rust/.gitignore

@@ -0,0 +1 @@
+/target

120. 三角形最小路径和/Rust/Cargo.lock

@@ -0,0 +1,9 @@
+[package]
+name = "Rust"
+version = "0.1.0"
+authors = ["wuyinjun <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]

120. 三角形最小路径和/Rust/Cargo.toml

@@ -0,0 +1,30 @@
+struct Solution {}
+
+impl Solution {
+    pub fn minimum_total(triangle: Vec<Vec<i32>>) -> i32 {
+        let n = triangle.len();
+        let mut f = vec![0; n];
+        f[0] = triangle[0][0];
+        for i in 1..n {
+            f[i] = f[i-1] + triangle[i][i];
+            for j in (1..=i-1).rev() {
+                f[j] = std::cmp::min(f[j-1], f[j]) + triangle[i][j];
+            }
+            f[0] += triangle[i][0];
+        }
+        match f.iter().min() {
+            Some(min) => {return *min;},
+            None => {return 0;}
+        }
+    }
+}
+
+fn main() {
+    let a = vec![2];
+    let b = vec![3,4];
+    let c = vec![6,5,7];
+    let d = vec![4,1,8,3];
+    let tmp = vec![a,b,c,d];
+    Solution::minimum_total(tmp);
+    println!("Hello, world!");
+}

120. 三角形最小路径和/Rust/src/main

@@ -0,0 +1,24 @@
+from typing import List
+
+class Solution:
+    def minimumTotal(self, triangle: List[List[int]]) -> int:
+        n = len(triangle)
+        f = [0] * n
+        f[0] = triangle[0][0]
+        print(f)
+        for i in range(1, n):
+            f[i] = f[i - 1] + triangle[i][i]
+            print(f)
+            for j in range(i - 1, 0, -1):
+                print("loop:" + str(j))
+                f[j] = min(f[j - 1], f[j]) + triangle[i][j]
+                print("min:" + str(f[j]))
+            f[0] += triangle[i][0]
+        print(f)
+        return min(f)
+
+if __name__ == "__main__":
+    # execute only if run as a script
+    list = [[2],[3,4],[6,5,7],[4,1,8,3]]
+    s = Solution()
+    s.minimumTotal(list)