{"push_id":720622497,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"79719d180470805d2be6da8e107abc488da84b06","before":"476e2e3e8e0cdc7da64be8fc775015c192b7655c","commits":[{"sha":"79719d180470805d2be6da8e107abc488da84b06","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"Minimum Path Sum - DP & Space O(n)\n\n1. 动态规划算法：设到达点(i, j)的和最小的路径为dp[i][j]，点(i, j)的数值为grid[i][j]，则dp[i][j] =\ngrid[i][j] + min{dp[i-1][j], dp[i][j-1]}；\n2. 时间复杂度为O(m*n)，空间复杂度为O(n)。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/79719d180470805d2be6da8e107abc488da84b06"}]}