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

class Solution {
public:
    bool find132pattern(vector<int>& nums) {
        if(nums.size()<3) return false;
        int min_val=INT_MAX; // 记录当前最小值，作为第一个数
        for(int i=0;i<nums.size();i++)
        {   // 遍历每一个元素作为第二个数
            min_val=min(min_val,nums[i]);
            if(min_val==nums[i]) continue;
            for(int j=i+1;j<nums.size();j++)
            {   // 搜索第三个数
                if(nums[j]>min_val&&nums[j]<nums[i]) 
                    return true;
            }
        }
        return false;
    }
};