comefrom: <doocs>0931.Minimum Falling Path Sum_1.py
code: def minFallingPathSum( matrix: List[List[int]]) -> int:
      n = len(matrix)
      for i in range(1, n):
          for j in range(n):
              mi = matrix[i - 1][j]
              if j > 0:
                  mi = min(mi, matrix[i - 1][j - 1])
              if j < n - 1:
                  mi = min(mi, matrix[i - 1][j + 1])
              matrix[i][j] += mi
      return min(matrix[n - 1])
masked: def sample_funcname ( var_0 : List [ List [ int ] ] ) -> int :
      var_4 = len ( var_0 )
      for var_7 in range ( 1 , var_4 ) :
          for var_8 in range ( var_4 ) :
              var_9 = var_0 [ var_7 - 1 ] [ var_8 ]
              if var_8 > 0 :
                  var_9 = min ( var_9 , var_0 [ var_7 - 1 ] [ var_8 - 1 ] )
              if var_8 < var_4 - 1 :
                  var_9 = min ( var_9 , var_0 [ var_7 - 1 ] [ var_8 + 1 ] )
              var_0 [ var_7 ] [ var_8 ] += var_9
      return min ( var_0 [ var_4 - 1 ] )
  