Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- bool find132pattern(vector<int>& nums) {
- if(nums.empty()) return false;
- set<pair<int,int> > s;
- for(int i=1;i<nums.size();i++) s.insert(make_pair(nums[i],i));
- int mn = nums[0];
- for(int i=1;i<nums.size();i++)
- {
- s.erase(make_pair(nums[i],i));
- auto it = s.upper_bound(make_pair(mn,INT_MAX));
- if(mn<nums[i] && (it!=s.end() && it->first < nums[i] && it->first > mn) )
- return true;
- mn = min(mn,nums[i]);
- }
- return false;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement