maximum-subarray-sum-after-one-operation

< Previous 　　　　　　　　　　　　　　　　 Next >

1746. Maximum Subarray Sum After One Operation (Medium)

Related Topics

[Array] [Dynamic Programming]

Hints

Hint 1

Think about dynamic programming

Hint 2

Define an array dp[nums.length][2], where dp[i][0] is the max subarray sum including nums[i] and without squaring any element.

Hint 3

dp[i][1] is the max subarray sum including nums[i] and having only one element squared.