Given a sequence of n integers a
1, a
2, ..., a
n, a 132 pattern is a subsequence a
i, a
j, a
k such that
i <
j <
k and a
i < a
k < a
j. 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].
分析:要求找到s1,s2,s3,且s2最大,s3其次。从后往前找,每一个遇到的数都有可能成为s3,只要它的前面有比他大的数。因此,可以用一个栈储存每次遇到的数,因为你想找到最大的s3,这样可以方便找s1。如果你遇到的数比栈里的元素还大,说明,这个元素可以成为s3了,因为它的前面有了一个比他大的数,而你这时遇到的数就是s2。栈里的元素一般是递减的,最大的满足条件的s3在底部,在他之上的都可以删了。因为它比最大的s3要小。在把这时遇到的数字压入栈中,它必定是栈中的最小元素。
bool find132pattern(vector<int>& nums) {
stack<int> stk;
int i,s3=INT_MIN;
for(i= nums.size()-1; i >= 0; i -- )
{
if(nums[i]<s3) return 1;
else while(!stk.empty()&&stk.top()<nums[i])
{
s3=stk.top();
stk.pop();
}
stk.push(nums[i]);
}
return 0;
}