|
| 1 | +/** |
| 2 | + * @param {number[]} nums |
| 3 | + * @return {number} |
| 4 | + */ |
| 5 | +var maxSumTrionic = function(nums) { |
| 6 | + let n = nums.length, res = Number.MIN_SAFE_INTEGER, psum = nums[0]; |
| 7 | + for (let l = 0, p = 0, q = 0, r = 1; r < nums.length; ++r) { |
| 8 | + psum += nums[r]; |
| 9 | + if (nums[r - 1] === nums[r]) { |
| 10 | + l = r; |
| 11 | + psum = nums[r]; |
| 12 | + } else if (nums[r - 1] > nums[r]) { |
| 13 | + if (r > 1 && nums[r - 2] < nums[r - 1]) { // flip |
| 14 | + p = r - 1; |
| 15 | + while (l < q) |
| 16 | + psum -= nums[l++]; |
| 17 | + while (l + 1 < p && nums[l] < 0) |
| 18 | + psum -= nums[l++]; |
| 19 | + } |
| 20 | + } else { |
| 21 | + if (r > 1 && nums[r - 2] > nums[r - 1]) // flip |
| 22 | + q = r - 1; |
| 23 | + if (l < p && p < q) |
| 24 | + res = Math.max(res, psum); |
| 25 | + } |
| 26 | + } |
| 27 | + return res; |
| 28 | +}; |
0 commit comments