LeetCode 456.132模式

单调栈不熟练

class Solution {
    public boolean find132pattern(int[] nums) {
        int len = nums.length;
        int ak = Integer.MIN_VALUE;
        Deque<Integer> queue = new ArrayDeque<>();
        if(len < 3) {
            return false;
        }
        for(int i = len - 1; i >= 0; i-- ){

            if(nums[i] < ak){
                return true;
            }

            while(!queue.isEmpty() && queue.peek() < nums[i]){
                ak = queue.poll();
            }

            queue.push(nums[i]);
        }
        return false;
    }

    
}