base情况是F(0) = 0和F(1) = 1。由于F(n)只与n之前的两个数的F()值有关,所有只需维护p1和p2两个数,不用维护整个dp数组,使得空间复杂度为O(1)。从2开始遍历,遍历到i时,res=F(i),因此for循环执行到n,此时res是F(n),返回res。
class Solution:
def fib(self, n: int) -> int:
if n <= 1:
return n
p1 = 0
p2 = 1
for _ in range(2, n+1):
res = p1 + p2
p1 = p2
p2 = res
return res
dp[i]表示到达台阶i+1有多少种方法;base情况是n=1或2;dp[i]可以由它往下一级/两级台阶转移而来(最后一步上一级/两级),dp[i]是前两个方法数之和。
class Solution:
def climbStairs(self, n: int) -> int:
if n <= 2:
return n
dp = [0 for _ in range(n)] #dp[i]: num of ways to step i+1
dp[0] = 1 #1
dp[1] = 2 #1+1 or 2
for i in range(2, n):
dp[i] = dp[i-1] + dp[i-2]
return dp[-1]
dp[i]:到达台阶i要花的最小体力;cost[i]:台阶i再往上1或2需要花的体力。由于初始可以从0或1开始,dp[0] = dp[1] = 0。
class Solution:
def minCostClimbingStairs(self, cost: List[int]) -> int:
if len(cost) == 2:
return min(cost[0], cost[1])
dp = [0 for _ in range(len(cost))]
for i in range(2, len(cost)):
dp[i] = min(dp[i-1] + cost[i-1], dp[i-2] + cost[i-2])
return min(dp[-1] + cost[-1], dp[-2] + cost[-2])