152 乘积最大子数组class Solution: def maxProduct(self, nums: list[int]) - int: f_minf_max1 ans-inf for x in nums: f_max,f_minmax(x,x*f_min,x*f_max),min(x,x*f_min,x*f_max) ansmax(ans,f_max) return ans416 分割等和子集class Solution: def canPartition(self, nums: List[int]) - bool: ssum(nums) if s%21:return False f[True][False]*s s//2 s20 for i,x in enumerate(nums): s2min(s,s2x) for j in range(s2,x-1,-1): f[j]f[j] or f[j-x] if f[s]:return True return False 
长河君 · 2026/10/6 8:09:17 · 阅读 1.2k 2026.10.5
152 乘积最大子数组class Solution: def maxProduct(self, nums: list[int]) - int: f_minf_max1 ans-inf for x in nums: f_max,f_minmax(x,x*f_min,x*f_max),min(x,x*f_min,x*f_max) ansmax(ans,f_max) return ans416 分割等和子集class Solution: def canPartition(self, nums: List[int]) - bool: ssum(nums) if s%21:return False f[True][False]*s s//2 s20 for i,x in enumerate(nums): s2min(s,s2x) for j in range(s2,x-1,-1): f[j]f[j] or f[j-x] if f[s]:return True return False