1746. Maximum Subarray Sum After One Operation (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def maxSumAfterOperation(self, nums: List[int]) -> int:
        result = 0
        s = n_s = 0
        for num in nums:
            s = max(s + num, n_s + num * num)
            n_s = max(0, n_s + num)
            result = max(result, s)
        return result