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

1594. 矩阵的最大非负积

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

89
src/main.rs
View File

@ -1,43 +1,78 @@
use std::cmp::max;
struct Solution; struct Solution;
mod arr; mod arr;
impl Solution { impl Solution {
fn is_same(mat: &Vec<Vec<i32>>, target: &Vec<Vec<i32>>) -> bool { pub fn max_product_path(mut grid: Vec<Vec<i32>>) -> i32 {
for i in 0..mat.len() { let mut v = vec![vec![(-1_i64, 1_i64); grid[0].len()]; grid.len()];
for j in 0..mat[i].len() { let md = 1e9 as i64 + 7;
if mat[i][j] != target[i][j] { if grid[0][0] >= 0 {
return false; v[0][0].0 = grid[0][0] as i64;
} else {
v[0][0].1 = grid[0][0] as i64;
}
for i in 1..grid[0].len() {
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;
} }
} }
} }
true for i in 1..grid.len() {
} if v[i - 1][0].0 >= 0 {
pub fn find_rotation(mat: Vec<Vec<i32>>, target: Vec<Vec<i32>>) -> bool { if grid[i][0] > 0 {
let mut v = vec![vec![0; mat[0].len()]; mat.len()]; v[i][0].0 = v[i-1][0].0 * grid[i][0] as i64;
if Solution::is_same(&mat, &target) { }else {
return true; v[i][0].1 = v[i-1][0].0 * grid[i][0] as i64;
}
for x in 1..4 {
for i in 0..mat.len() {
for j in 0..mat[i].len() {
let (mut py, mut px) = (i, j);
for _ in 0..x {
(px, py) = (mat.len() - 1 - py, px)
}
v[py][px] = mat[i][j];
} }
} }
if Self::is_same(&v, &target) { if v[i - 1][0].1 <= 0 {
return true; if grid[i][0] > 0 {
v[i][0].1 = v[i-1][0].1 * grid[i][0] as i64;
}else {
v[i][0].0 = v[i-1][0].1 * grid[i][0] as i64;
} }
} }
false 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
} }
} }
fn main() { fn main() {
let result = Solution::find_rotation( let result = Solution::max_product_path(arr::make_matrix(r#"[[1,3],[0,-4]]"#));
arr::make_matrix(r#"[[1,0,0],[1,0,1],[0,0,1]]"#),
arr::make_matrix(r#"[[0,1,1],[0,0,0],[1,1,0]]"#),
);
println!("{:?}", result); println!("{:?}", result);
} }
/*
[[1,4,4,0]
,[-2,0,0,1]
,[1,-1,1,1]]
*/