leetcode456专题

leetcode456_3-24每日题:132模式

class Solution {public:bool find132(vector<int>& nums,int start,int end){if(end-start+1<3) return false;int max = nums[start];int maxn = start;for(int i=start+1;i<=end;i++){maxn = nums[i]>=max?i:maxn