mfocko/LeetCode
1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-09 15:59:06 +01:00
Code Issues Projects Releases Wiki Activity

cs: add «1289. Minimum Falling Path Sum II»

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2024-04-26 19:55:26 +02:00
parent e3d66b09ab
commit b3f3754634
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 44 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

44
cs/minimum-falling-path-sum-ii.cs Normal file
View file

@ -0,0 +1,44 @@
public class Solution {
private int[,] PrepareDP(int[][] grid) {
int[,] dp = new int[grid.Length, grid.Length];
var y = grid.Length - 1;
for (var x = 0; x < grid.Length; ++x) {
dp[y, x] = grid[y][x];
}
return dp;
}
private void Compute(int[][] grid, int[,] dp, int y, int x0) {
var minimum = int.MaxValue;
for (var x = 0; x < grid.Length; ++x) {
// need to continue with different column
if (x == x0) {
continue;
}
minimum = Math.Min(minimum, dp[y + 1, x]);
}
dp[y, x0] = grid[y][x0] + minimum;
}
public int MinFallingPathSum(int[][] grid) {
var dp = PrepareDP(grid);
for (var y = grid.Length - 2; y >= 0; --y) {
for (var x = 0; x < grid.Length; ++x) {
Compute(grid, dp, y, x);
}
}
int minFallingPath = int.MaxValue;
for (var x = 0; x < grid.Length; ++x) {
minFallingPath = Math.Min(minFallingPath, dp[0, x]);
}
return minFallingPath;
}
}