Package g3501_3600.s3523_make_array_non_decreasing

Class Solution

java.lang.Object

g3501_3600.s3523_make_array_non_decreasing.Solution

public class Solution
extends Object

3523 - Make Array Non-decreasing.

Medium

You are given an integer array nums. In one operation, you can select a subarray and replace it with a single element equal to its maximum value.

Return the maximum possible size of the array after performing zero or more operations such that the resulting array is non-decreasing.

A subarray is a contiguous non-empty sequence of elements within an array.

Example 1:

Input: nums = [4,2,5,3,5]

Output: 3

Explanation:

One way to achieve the maximum size is:

1. Replace subarray nums[1..2] = [2, 5] with 5 \u2192 [4, 5, 3, 5].
2. Replace subarray nums[2..3] = [3, 5] with 5 \u2192 [4, 5, 5].

The final array [4, 5, 5] is non-decreasing with size 3.

Example 2:

Input: nums = [1,2,3]

Output: 3

Explanation:

No operation is needed as the array [1,2,3] is already non-decreasing.

Constraints:

• 1 <= nums.length <= 2 * 105
• 1 <= nums[i] <= 2 * 105

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumPossibleSize(int[] nums)

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

maximumPossibleSize

public int maximumPossibleSize(int[] nums)