g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array

Class Solution

java.lang.Object

g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array.Solution

public class Solution
extends Object

2369 - Check if There is a Valid Partition For The Array.

Medium

You are given a 0-indexed integer array nums. You have to partition the array into one or more contiguous subarrays.

We call a partition of the array valid if each of the obtained subarrays satisfies one of the following conditions:

1. The subarray consists of exactly 2 equal elements. For example, the subarray [2,2] is good.
2. The subarray consists of exactly 3 equal elements. For example, the subarray [4,4,4] is good.
3. The subarray consists of exactly 3 consecutive increasing elements, that is, the difference between adjacent elements is 1. For example, the subarray [3,4,5] is good, but the subarray [1,3,5] is not.

Return true if the array has at least one valid partition. Otherwise, return false.

Example 1:

Input: nums = [4,4,4,5,6]

Output: true

Explanation: The array can be partitioned into the subarrays [4,4] and [4,5,6]. This partition is valid, so we return true.

Example 2:

Input: nums = [1,1,1,2]

Output: false

Explanation: There is no valid partition for this array.

Constraints:

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

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
boolean	validPartition(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Detail

Solution

public Solution()

Method Detail

validPartition

public boolean validPartition(int[] nums)