Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1793 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1793 # by problem number
lcpy gen -s maximum_score_of_a_good_subarray # by problem name
nums (0-indexed) and an integer k.
The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1). A good subarray is a subarray where i <= k <= j.
Return the maximum possible score of a good subarray.
Input: nums = [1,4,3,7,4,5], k = 3
Output: 15
Explanation: The optimal subarray is (1, 5) with a score of min(4,3,7,4,5) * (5-1+1) = 3 * 5 = 15.
Input: nums = [5,5,4,5,4,1,1,1], k = 0
Output: 20
Explanation: The optimal subarray is (0, 4) with a score of min(5,5,4,5,4) * (4-0+1) = 4 * 5 = 20.
1 <= nums.length <= 10^51 <= nums[i] <= 2 * 10^40 <= k < nums.lengthclass Solution:
# Time: O(n)
# Space: O(1)
def maximum_score(self, nums: list[int], k: int) -> int:
left = right = k
cur_min = nums[k]
best = cur_min
while left > 0 or right < len(nums) - 1:
next_left = nums[left - 1] if left > 0 else 0
next_right = nums[right + 1] if right < len(nums) - 1 else 0
if next_left >= next_right:
left -= 1
else:
right += 1
cur_min = min(cur_min, max(next_left, next_right))
best = max(best, cur_min * (right - left + 1))
return best
| Time | Space |
|---|---|
| O(n) | O(1) |