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.
样例
Given nums = [1, 2, 3, 4]
return False // There is no 132 pattern in the sequence.

Given nums = [3, 1, 4, 2]
return True // There is a 132 pattern in the sequence: [1, 4, 2].

n will be less than 20,000.

一开始我也是很虎，用三重循环硬做，能不TLE才怪……
题目标签里说要用栈，我纳了闷了也没想到怎么用栈，从网上看了看别人的思路，原来是这样。
这个栈里只保存着第二个数字，也就是最大的数字，再用一个int变量third保存第三个数字，也就是第二大的数字，遍历的时候不断更新栈里的和third，如果遇到一个比third还小的数字，那么这个数字，加上栈里的数字，加上third，刚好凑齐一个132pattern。学到了。

class Solution {
public:
    /**
     * @param nums a list of n integers
     * @return true if there is a 132 pattern or false
     */
    bool find132pattern(vector<int>& nums) {
        // Write your code here
        if(nums.size() <= 2){
            return false;
        }
        stack<int> s;
        int third = -10000000;
        for(int i = nums.size() - 1; i >= 0; i--){
            if (nums[i] < third){
                return true;
            }else{
                while(!s.empty() && nums[i] > s.top()){
                        third = s.top();
                        s.pop();
                }
                s.push(nums[i]);
            }

        }
        return false;
    }
};