nkey/leetcode-study
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

152 성공

Browse Source
This commit is contained in:
nkey
2026-10-14 16:37:19 +09:00
parent b1bfd782e4
commit 6266febe5f
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
repetition/dp/152.py
View File

@@ -8,8 +8,8 @@ class Solution:
for num in nums[1:]: for num in nums[1:]:
temp_min = now_min temp_min = now_min
now_min = (num, now_max * num, now_min * num) now_min = min(num, now_max * num, now_min * num)
now_max = (num, now_max * num, temp_min * num) now_max = max(num, now_max * num, temp_min * num)
answer = max(answer, now_max) answer = max(answer, now_max)