Leetcode 132Pattern 题意很简单，过程很巧妙

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].

  题意很简单，就是在一串数字中按顺序找出三个数字(不需要相邻)s1, s2, s3，满足s1<s3<s2，这个题目类似于另一个题目Increasing Triplet Subsequence(s1<s2<s3)，那道题目限制了O(n) time, O(1) space，通过维护s1<s2，一旦发现了s2<s3就达到目的来实现。
  此题类似，通过维护s2>s3，一旦发现s1<s3来实现，所以遍历数组的顺序采用从右向左，维护s2>s3则通过一个栈和一个变量来实现，栈来表示s2，变量来表示s3。当遍历到的第i个元素，若input[i]比s3大，就将input[i]入栈，入栈时要注意，若input[i]大于栈顶，则将栈顶赋值给s3，直到input[i]不在大于栈顶，然后再将其入栈。整个过程始终维护栈中的所有值都大于s3，当遍历到比s3小的值，直接返回true。

class Solution {
public:
    bool find132pattern(vector<int>& nums) {
        stack<int> s2;
        int s3 = INT_MIN;
        int n = nums.size();
        for(int i = n-1;i>=0;i--){
            if(s3>nums[i]){
                return true;
            }
            while(!s2.empty()&&nums[i]>s2.top()){
                s3 = s2.top();s2.pop();
            }
            s2.push(nums[i]);
        }
        return false;
    }
}; 

参考于leetcode评语区：https://leetcode.com/problems/132-pattern/discuss/94071/Single-pass-C%2B%2B-O(n)-space-and-time-solution-(8-lines)-with-detailed-explanation