LeetCode #456. 132 Pattern

关注

原创最新推荐文章于 2023-07-09 12:17:10 发布 219 阅读 AI 写同款· GEO 优化 ›

456. 132 模式通过使用栈和倒序遍历数组，我们可以高效地寻找 132 模式的子序列。这个方法避免了暴力三重循环的O(n^3)时间复杂度，优化为O(n)，使得算法可以处理大规模的输入数据。栈的使用保证了我们可以在一次遍历中有效地管理和更新可能的子序列，从而提升了计算效率。阅读详情

题目描述：

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;
    }
};

收录于