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.

思路：

开始想的用栈来找一个递增的序列，如果遇见比它小的，就出栈，知道找打栈里还有比它小的为止，但是这样会遗漏前面较大的区间，别人的是琮后面开始入栈，只要找到一个比第二大的数小的就行了。

https://discuss.leetcode.com/topic/67881/single-pass-c-o-n-space-and-time-solution-8-lines-with-detailed-explanation

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

记录错误：

class Solution {
public:
    bool find132pattern(vector<int>& nums) {
        stack<int> re;
        if(nums.size() <= 2) return false;
        re.push(nums[0]);
        int min = nums[0];
        for(int i = 1; i < nums.size(); i++) {
            if(re.empty()){
                re.push(nums[i]);
            } else {
                if(nums[i]>=re.top()) {
                    re.push(nums[i]);
                } else {
		    while(!re.empty()&&re.top()>nums[i]) re.pop();
                    if(re.empty()) {
                        re.push(nums[i]);
                        min = nums[i];
                    } else {
                        if(nums[i] > min)  return true;
                    }
                }
            }
        }
        return false;
    }
};