algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2664 from YingfanGu/master

Browse Source 
修复 0121. 买卖股票的最佳时机 一处typo
This commit is contained in:
程序员Carl
2024-08-04 09:39:09 +08:00
committed by GitHub
parent 775f8c66b9 ba773d93be
commit e2933951f0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0121.买卖股票的最佳时机.md
View File

@ -308,7 +308,7 @@ class Solution:
class Solution: class Solution:
def maxProfit(self, prices: List[int]) -> int: def maxProfit(self, prices: List[int]) -> int:
length = len(prices) length = len(prices)
if len == 0: if length == 0:
return 0 return 0
dp = [[0] * 2 for _ in range(length)] dp = [[0] * 2 for _ in range(length)]
dp[0][0] = -prices[0] dp[0][0] = -prices[0]