My Blog List

[Leetcode Solution] Minimum Path Sum

Analysis 

  • Dynamic Programming
  • F[i][j]=min(F[i-1][j],F[i][j-1]) + grid[i][j]
  • Note the corner condition

Note

Code


at

No comments:

Post a Comment

Enter you comment

Subscribe to: Post Comments (Atom)