class Solution {
public:
bool find132pattern(vector<int>& nums) {
int n = nums.size();
int k = INT_MIN;
stack<int> stk;
for (int i = n - 1; i >= 0; i -- ) {
if (nums[i] < k) return true;
while (stk.size() && nums[i] > stk.top()) {
k = max(k, stk.top());
stk.pop();
}
stk.push(nums[i]);
}
return false;
}
};