python-cpp-journey/day59.cpp at main · amlan-sinha07/python-cpp-journey · 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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
class MyCircularQueue {
    vector<int>data;
    int capacity,head,tail,size;
public:
    MyCircularQueue(int k): data(k),head(0),tail(-1),size(0),capacity(k){}

    bool enQueue(int value) {
        if (isFull()) return false;
        tail=(tail+1)%capacity;
        data[tail]=value;
        size++;
        return true;
    }

    bool deQueue() {
        if (isEmpty()) return false;
        head=(head+1)% capacity;
        size--;
        return true;
    }

    int Front() {
        return isEmpty() ? -1: data[head];
    }

    int Rear() {
        return isEmpty() ? -1: data[tail];
    }

    bool isEmpty() {
        return size==0;
    }

    bool isFull() {
        return size==capacity;
    }
};

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue* obj = new MyCircularQueue(k);
 * bool param_1 = obj->enQueue(value);
 * bool param_2 = obj->deQueue();
 * int param_3 = obj->Front();
 * int param_4 = obj->Rear();
 * bool param_5 = obj->isEmpty();
 * bool param_6 = obj->isFull();
 */
vector<int>nextGreater(vector<int>&nums){
    int n=nums.size();
    vector<int>ans(n,-1);
    stack<int>st;
    for (int i=n-1;i>=0;--i){
        while (!st.empty()&& nums[st.top()]<=nums[i]){
            st.pop();
        }
        if (!st.empty()){
            ans[i]=nums[st.top()];
        }
        st.push(i);
    }
    return ans;
};
vector<int>nextSmall(vector<int>&nums){
    int n=nums.size();
    vector<int>ans(n,-1);
    stack<int>st;
    for (int i=n-1;i>=0;--i){
        while (!st.empty() && nums[st.top()]>=nums[i]){
            st.pop();
        }
        if (!st.empty()){
            ans[i]=nums[st.top()];
        }
        st.push(i);
    }
    return ans;
};
vector<int>previousGreater(vector<int>&nums){
    int n=nums.size();
    vector<int>ans(n,-1);
    stack<int>st;
    for(int i=0;i<n;++i){
        while(!st.empty()&& nums[st.top()]<=nums[i]){
            st.pop();
        }
        if (!st.empty()){
            ans[i]=nums[st.top()];
        }
        st.push(i);
    }
    return ans;
}
class Solution739 {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
        int n=temperatures.size();
        vector<int>ans(n,0);
        stack<int>st;
        for(int i=n-1;i>=0;--i){
            while(!st.empty()&& temperatures[st.top()]<=temperatures[i]){
                st.pop();
            }
            if (!st.empty()){
                ans[i]=st.top()-i;
            }
            st.push(i);
        }
        return ans;
    }
};