li_chx
/
rust_test
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2906. 构造乘积矩阵

This commit is contained in:
li_chx 2026-03-24 11:09:45 +08:00
parent f1f47604f8
commit d7f5b98838
No known key found for this signature in database
GPG Key ID: 70D4985BB8180E92
1 changed files with 27 additions and 61 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
src/main.rs
View File

@ -1,78 +1,44 @@
use std::cmp::max;
struct Solution; struct Solution;
mod arr; mod arr;
impl Solution { impl Solution {
pub fn max_product_path(mut grid: Vec<Vec<i32>>) -> i32 { fn get_product(a: i32, b: i32) -> i32 {
let mut v = vec![vec![(-1_i64, 1_i64); grid[0].len()]; grid.len()]; ((a as i64 * b as i64) % 12345) as i32
let md = 1e9 as i64 + 7; }
if grid[0][0] >= 0 { pub fn construct_product_matrix(mut grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
v[0][0].0 = grid[0][0] as i64; let mut arr = vec![0; grid.len() * grid[0].len()];
} else { let mut ans = vec![0; grid.len() * grid[0].len()];
v[0][0].1 = grid[0][0] as i64; for i in 0..grid.len() {
} for j in 0..grid[0].len() {
for i in 1..grid[0].len() { arr[i * grid[0].len() + j] = grid[i][j];
let x = grid[0][i] as i64;
if v[0][i - 1].0 >= 0 {
if x < 0 {
v[0][i].1 = v[0][i - 1].0 * x;
} else {
v[0][i].0 = v[0][i - 1].0 * x;
}
}
if v[0][i - 1].1 <= 0 {
if x < 0 {
v[0][i].0 = v[0][i - 1].1 * x;
} else {
v[0][i].1 = v[0][i - 1].1 * x;
}
} }
} }
for i in 1..grid.len() { ans[0] = arr[0];
if v[i - 1][0].0 >= 0 { for i in 1..arr.len() {
if grid[i][0] > 0 { ans[i] = Solution::get_product(arr[i], ans[i - 1]);
v[i][0].0 = v[i-1][0].0 * grid[i][0] as i64; }
}else { let mut last = arr[ans.len() - 1];
v[i][0].1 = v[i-1][0].0 * grid[i][0] as i64; for i in (1..arr.len()-1).rev() {
} let x = arr[i];
} arr[i] = Solution::get_product(ans[i-1], last);
if v[i - 1][0].1 <= 0 { last = Solution::get_product(last, x)
if grid[i][0] > 0 { }
v[i][0].1 = v[i-1][0].1 * grid[i][0] as i64; arr[0] = last % 12345;
}else { arr[ans.len() - 1] = ans[ans.len() - 2] % 12345;
v[i][0].0 = v[i-1][0].1 * grid[i][0] as i64; for i in 0..grid.len() {
} for j in 0..grid[0].len() {
} grid[i][j] = arr[i * grid[0].len() + j];
for j in 1..grid[i].len() {
let mp = max(v[i-1][j].0,v[i][j-1].0);
let mn = -max(-v[i-1][j].1,-v[i][j-1].1);
if grid[i][j] > 0 {
if mp >= 0 {
v[i][j].0 = mp * grid[i][j] as i64;
}
if mn <= 0 {
v[i][j].1 = mn * grid[i][j] as i64;
}
}else {
if mp >= 0 {
v[i][j].1 = mp * grid[i][j] as i64;
}
if mn <= 0 {
v[i][j].0 = mn * grid[i][j] as i64;
}
}
} }
} }
(v[grid.len() - 1][grid[0].len() - 1].0 % md) as i32 grid
} }
} }
fn main() { fn main() {
let result = Solution::max_product_path(arr::make_matrix(r#"[[1,3],[0,-4]]"#)); let result = Solution::construct_product_matrix(arr::make_matrix(r#"[[1,2],[3,4]]"#));
println!("{:?}", result); println!("{:?}", result);
} }
/* /*
[[1,4,4,0] [[1,4,4,0]
,[-2,0,0,1] ,[-2,0,0,1]
,[1,-1,1,1]] ,[1,-1,1,1]]
*/ */