-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1019.cpp
145 lines (135 loc) · 3.63 KB
/
1019.cpp
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
__________________________________________________________________________________________________
sample 164 ms submission
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
static int x = [](){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0;
}();
class Solution {
public:
ListNode* reverse_linked(ListNode* head) {
if(head == NULL or head -> next == NULL) {
return head;
}
ListNode* curr = head;
ListNode* nex = head -> next;
curr -> next = NULL;
while(nex != NULL) {
ListNode* after_next = nex -> next;
nex -> next = curr;
curr = nex;
nex = after_next;
}
return curr;
}
vector<int> nextLargerNodes(ListNode* head) {
vector < int > ans;
if(head == NULL) {
return ans;
}
head = reverse_linked(head);
stack < int > st;
ListNode* curr = head;
while(curr != NULL) {
while(!st.empty() and st.top() <= (curr -> val)) {
st.pop();
}
if(st.empty()) {
ans.push_back(0);
} else {
ans.push_back(st.top());
}
st.push(curr -> val);
curr = curr -> next;
}
reverse(ans.begin(), ans.end());
return ans;
}
};
__________________________________________________________________________________________________
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> nextLargerNodes(ListNode* h) {
vector<int> res, stack;
for (auto p = h; p != nullptr; p = p->next) res.push_back(p->val);
for (int i = res.size() - 1; i >= 0; --i) {
auto val = res[i];
while (!stack.empty() && stack.back() <= res[i]) stack.pop_back();
res[i] = stack.empty() ? 0 : stack.back();
stack.push_back(val);
}
return res;
}
};
__________________________________________________________________________________________________
sample 168 ms submission
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
ListNode* reverse_list(ListNode* head) {
if (!head || !head->next) return head;
ListNode* prev = NULL;
while (head) {
auto node = prev;
prev = head;
head = head->next;
prev->next = node;
}
return prev;
}
public:
vector<int> nextLargerNodes(ListNode* head) {
vector<int> result;
head = reverse_list(head);
if (!head) return result;
ListNode* prev = NULL;
stack<int> st;
while (head) {
if(st.empty()) {
result.push_back(0);
} else {
while (!st.empty() && st.top() <= head->val) {
st.pop();
}
if (st.empty()) {
result.push_back(0);
} else {
result.push_back(st.top());
}
}
st.push(head->val);
head = head->next;
}
reverse(result.begin(), result.end());
return result;
}
};
auto ___ = []() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0;
}();