请问这里递推式dp[i+1]为什么=max(dp[j + 1], dp[j] + fuel)，dp[i+1]不是还没求出来吗怎么比较大小

Question

https://leetcode.cn/problems/minimum-number-of-refueling-stops/solutions/1636921/zui-di-jia-you-ci-shu-by-leetcode-soluti-nmga

class Solution:
    def minRefuelStops(self, target: int, startFuel: int, stations: list[list[int]]) -> int:
        dp = [startFuel] + [0] * len(stations)
        for i, (pos, fuel) in enumerate(stations):
            for j in range(i, -1, -1):
                if dp[j] >= pos:
                    dp[j + 1] = max(dp[j + 1], dp[j] + fuel)
        return next((i for i, v in enumerate(dp) if v >= target), -1)

print(Solution().minRefuelStops(100,1,[[10,100]]))

请问这里递推式dp[i+1]为什么=max(dp[j + 1], dp[j] + fuel)，dp[i+1]不是还没求出来吗怎么比较大小

Answer 1

第三行设定了初始值为0， 一开始和0比较大小.