package question;

import java.util.Stack;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question456 {
 public boolean find132pattern(int[] nums) {
 Stack<Integer> stack = new Stack<>();
 int right=Integer.MIN_VALUE;
 for (int i = nums.length - 1; i >= 0; i--) {
 if (nums[i]<right) return true;
 while (!stack.isEmpty() && nums[i]>stack.peek()) {
 right = Math.max(right, stack.pop());
 }
 stack.push(nums[i]);
 }
 return false;
 }
}