init

problems/p18/src/main.rs

@@ -0,0 +1,34 @@
+fn max_path_sum(triangle: Vec<Vec<i32>>) -> i32 {
+    let n = triangle.len();
+    let mut dp = triangle.clone();
+
+    // 从倒数第二行开始，自底向上计算
+    for i in (0..n - 1).rev() {
+        for j in 0..triangle[i].len() {
+            dp[i][j] += dp[i + 1][j].max(dp[i + 1][j + 1]);
+        }
+    }
+
+    dp[0][0]
+}
+fn main() {
+    let numbers: Vec<Vec<i32>> = vec![
+        vec![75],
+        vec![95, 64],
+        vec![17, 47, 82],
+        vec![18, 35, 87, 10],
+        vec![20, 4, 82, 47, 65],
+        vec![19, 1, 23, 75, 3, 34],
+        vec![88, 2, 77, 73, 7, 63, 67],
+        vec![99, 65, 4, 28, 6, 16, 70, 92],
+        vec![41, 41, 26, 56, 83, 40, 80, 70, 33],
+        vec![41, 48, 72, 33, 47, 32, 37, 16, 94, 29],
+        vec![53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14],
+        vec![70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57],
+        vec![91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48],
+        vec![63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31],
+        vec![4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23],
+    ];
+    let result = max_path_sum(numbers);
+    println!("最大路径和: {result}");
+}