Fmars Blog
Inner happiness comes from self-sacrifice
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
No comments:
Post a Comment
Enter you comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Enter you comment