LeetCode 456. 132 Pattern

Given a sequence of n integers a1, a2, …, an, a 132 pattern is a subsequence ai, aj, ak such that i < j < k and ai < ak < aj. Design an algorithm that takes a list of n numbers as input and checks whether there is a 132 pattern in the list.

Note: n will be less than 15,000.

Example 1:
Input: [1, 2, 3, 4]

Output: False

Explanation: There is no 132 pattern in the sequence.
Example 2:
Input: [3, 1, 4, 2]

Output: True

Explanation: There is a 132 pattern in the sequence: [1, 4, 2].
Example 3:
Input: [-1, 3, 2, 0]

Output: True

Explanation: There are three 132 patterns in the sequence: [-1, 3, 2], [-1, 3, 0] and [-1, 2, 0].

我们可以用栈维护次最大值 top为当前最大值。这样的维护栈 需要的是逆序维护 当我们找到一个比次最大值小的是数时 则存在132

class Solution {
public:
    bool find132pattern(vector<int>& nums) {
    stack<int>q;
    int t = -1e9;
    for(int i=nums.size()-1;~i;i--)
    {
        if(nums[i]<t)
            return true;
        while(q.size()&&nums[i]>q.top())
        {
            t=q.top();
            q.pop();
        }
        q.push(nums[i]);
    }
    return false;
    }
};