Package g1701_1800.s1793_maximum_score_of_a_good_subarray

Class Solution

java.lang.Object

g1701_1800.s1793_maximum_score_of_a_good_subarray.Solution

public class Solution
extends Object

1793 - Maximum Score of a Good Subarray\. Hard You are given an array of integers `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._ **Example 1:** **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. **Example 2:** **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. **Constraints:** * 1 <= nums.length <= 105 * 1 <= nums[i] <= 2 * 104 * `0 <= k < nums.length`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumScore(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maximumScore

public int maximumScore(int[] nums,
 int k)