New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

dp 最小路径和的公式写错了 #1

Closed

dlc1994 opened this issue Apr 15, 2019 · 1 comment

dlc1994 commented Apr 15, 2019

写成了dp[i][j]=min(dp[i-1][j]+dp[i][j-1]) +dp[i-1][j-1]
最后的dp[i-1][j-1]应该是路径值grid[i-1][j-1]

Owner

Miller-Xie commented Apr 26, 2019

OK 改过来了

Miller-Xie closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment