<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. You have to partition the array into one or more <strong>contiguous</strong> subarrays.</p>

<p>We call a partition of the array <strong>valid</strong> if each of the obtained subarrays satisfies <strong>one</strong> of the following conditions:</p>

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

<p>Return <code>true</code><em> if the array has <strong>at least</strong> one valid partition</em>. Otherwise, return <code>false</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,4,4,5,6]
<strong>Output:</strong> true
<strong>Explanation:</strong> The array can be partitioned into the subarrays [4,4] and [4,5,6].
This partition is valid, so we return true.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1,2]
<strong>Output:</strong> false
<strong>Explanation:</strong> There is no valid partition for this array.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
</ul>

class Solution {
public:
    bool validPartition(vector<int>& nums) {
        int n = nums.size();
        int dp[n];
        if(n==1)return 0;
        dp[0] = 0;
        dp[1] = (nums[0]==nums[1])?1:0;
        if(n==2)return dp[1];
        if(dp[1]==1 and nums[0]==nums[2]){
            dp[2] = 1;
        }
        else if(nums[0] + 2 == nums[2] and nums[1] + 1 == nums[2]){
            dp[2] = 1;
        }
        else{
            dp[2]=0;
        }
        for(int i=3;i<n;i++){
            if(dp[i-3]==1 and ((nums[i-1]==nums[i] and 
                        nums[i-2]==nums[i]) or (nums[i-2]+2==nums[i] and nums[i-1]+1==nums[i]))){
                            dp[i]=1;
                        }
            else if(dp[i-2]==1 and nums[i-1]==nums[i]){
                dp[i] = 1;
            }
            else{
                dp[i] = 0;
            }
        }
        // for(int i=0;i<n;i++){
        //     cout<<dp[i]<<" ";
        // }
        return dp[n-1];
    }
};
87000