class Solution public int minFallingPathSumvectorvectorint& grid int n = gridsize; vectorvectorint dn vectorintn INT_MAX; for int i = 0; i n; i++ d0i = grid0i; for int

class Solution { int minFallingPathSum(List<List> grid) { int n = grid.length; List<List> d = List.generate(n, (_) => List.filled(n, int.maxValue)); for (int i = 0; i < n; i++) d[0][i] = grid[0][i]; for (int i = 1; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (j != k) { d[i][j] = min(d[i][j], d[i - 1][k] + grid[i][j]); } } } } int res = int.maxValue; for (int j = 0; j < n; j++) { res = min(res, d[n - 1][j]); } return res; }