leetcode/132 pattern.cpp at master · shubhgup11/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
class Solution {
public:
    bool find132pattern(vector<int>& nums) {
        vector <int> v;
        int min=INT_MAX;
        stack <int> s;
        int flag=0;
        int i;
        for(i=0;i<nums.size();i++)
        {
            if(nums[i]<min)
            {
                min=nums[i];
                v.push_back(nums[i]);
            }
            else
                v.push_back(min);
        }
        for(i=0;i<nums.size();i++)
        {
            cout<<v[i]<<" ";
        }
        cout<<endl;
        for(i=(nums.size()-1);i>=0;i--)
        {
            if(s.empty() )
               {if(nums[i]>v[i])
               {
               s.push(nums[i]);
               }
               }
            else
               {
                   if(nums[i] > v[i] && nums[i]<s.top())
                       s.push(nums[i]);
                    else if(nums[i]>s.top())
                    {
                        //cout<<nums[i]<<" "<<s.top();
                        flag=1;
                        break;
                    }
                   else if(nums[i]==v[i])
                   {
                       if(i>=1)
                       {
                           while( !s.empty() && s.top()<=v[i-1] )
                           {
                               //cout<<"tttt"<<v[i-1]<<endl;
                               s.pop();
                           }
                       }
                   }

               }
            //cout<<"top"<<s.top()<<endl;
        }
    if(flag==1)
    return (2<5);
    else
        return (2>5);
    }
};