LeetCode2369. Check if There is a Valid Partition For The Array——动态规划

一、题目

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:

The subarray consists of exactly 2, equal elements. For example, the subarray [2,2] is good.
The subarray consists of exactly 3, equal elements. For example, the subarray [4,4,4] is good.
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

二、题解

class Solution {
public:
    bool validPartition(vector<int>& nums) {
        int n = nums.size();
        vector<bool> dp(n,false);
        if(nums[1] == nums[0]) dp[1] = true;
        if(n > 2 && ((nums[2] == nums[1] && nums[1] == nums[0]) || (nums[2] == nums[1] + 1 && nums[1] == nums[0] + 1))) dp[2] = true;
        for(int i = 3;i < n;i++){
            bool flag1 = false,flag2 = false,flag3 = false;
            if(nums[i] == nums[i-1]) flag1 = dp[i-2];
            if(nums[i] == nums[i-1] && nums[i-1] == nums[i-2]) flag2 = dp[i-3];
            if(nums[i] == nums[i-1] + 1 && nums[i-1] == nums[i-2] + 1) flag3 = dp[i-3]; 
            if(flag1 || flag2 || flag3) dp[i] = true;
        }
        return dp[n-1];
    }
};