LeetCode456 132Pattern

---

Given a sequence of n integers a₁, a₂, ..., a_n, a 132 pattern is a subsequence a_i, a_j, a_k suchthat i < j < k and a_i < a_k < a_j. 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].

思路：这题主要的目的就是是否能找到一个这样的序列，先升后降的序列，而且下降的值不能小于第一个先升的初值，那么我们可以利用栈来做这题：

（1） 首先我们创建一个新数组，存储原始数组的前n-1个数值。也就是newarray[i] = nums[i - 1]

（2）申请栈sta，从后遍历原始数组：1 如果栈为空或者栈顶元素大于当前元素，则把元素压入栈中；2  否则进行栈循环，看栈顶元素是否大于新数组的第i个数值，如果大于则返回true,否则出栈，继续循环。

(3)若未找到则返回false。

具体代码如下：

bool find132pattern(vector<int>& nums) {
        vector<int> small(nums.size(), INT_MAX);
        for (int i = 1; i < nums.size(); i++) {
            small[i] = min(small[i - 1], nums[i - 1]);
        }
        stack<int> stk;
        for (int i = (int)nums.size() - 1; i >= 1; i--) {
            while (!stk.empty() && stk.top() < nums[i]) {
                if (stk.top() > small[i]) {
                    return (true);
                }
                stk.pop();
            }
            stk.push(nums[i]);
        }
        return (false);
    }