企业官网建设流程全解析

152 乘积最大子数组

class Solution: def maxProduct(self, nums: list[int]) -> int: f_min=f_max=1 ans=-inf for x in nums: f_max,f_min=max(x,x*f_min,x*f_max),min(x,x*f_min,x*f_max) ans=max(ans,f_max) return ans

416 分割等和子集

class Solution: def canPartition(self, nums: List[int]) -> bool: s=sum(nums) if s%2==1:return False f=[True]+[False]*s s//=2 s2=0 for i,x in enumerate(nums): s2=min(s,s2+x) for j in range(s2,x-1,-1): f[j]=f[j] or f[j-x] if f[s]:return True return False