689.三个无重叠子数组的最大和（Hard）

• 题解
  

class Solution:def maxSumOfThreeSubarrays(self, nums: List[int], k: int) -> List[int]:N &＃61; len(nums)ss &＃61; [sum(nums[:k])]for i in range(k, N) :ss.append(ss[-1] &＃43; nums[i] - nums[i-k])maxl, maxr &＃61; ss[0], max(ss[2*k:])lp, rp &＃61; 0, ss.index(maxr, 2*k)maxval &＃61; maxl &＃43; maxr &＃43; ss[k]res &＃61; [lp, k, rp]for i in range(k&＃43;1, N-2*k&＃43;1) :changed &＃61; Falseif ss[i-k] > maxl:changed &＃61; Truemaxl, lp &＃61; ss[i-k], i-kif ss[i&＃43;k-1] &＃61;&＃61; maxr:changed &＃61; Truemaxr &＃61; max(ss[i&＃43;k:])rp &＃61; ss.index(maxr,i&＃43;k)if ss[i] > ss[i-1] or changed:sss &＃61; maxl &＃43; maxr &＃43; ss[i]if sss > maxval:maxval &＃61; sssres &＃61; [lp, i, rp]return res