2025/10/16
思路：动态规划
MaxStolen[n] = max(MaxStolen[n-1], MaxStolen[n-2] + Amount[n]) MaxStolen[1] = Amount[1] MaxStolen[2] = max(Amount[1], Amount[2])
答案：完全正确，标准动态规划题，秒了
House Robber
思路：动态规划
MaxStolen[n] = max(MaxStolen[n-1], MaxStolen[n-2] + Amount[n]) MaxStolen[1] = Amount[1] MaxStolen[2] = max(Amount[1], Amount[2])
答案：完全正确，标准动态规划题，秒了