-
Notifications
You must be signed in to change notification settings - Fork 0
/
Problem_1019_nextLargerNodes.cc
66 lines (59 loc) · 1.36 KB
/
Problem_1019_nextLargerNodes.cc
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
#include <iostream>
#include <utility>
#include <vector>
#include "UnitTest.h"
using namespace std;
struct ListNode
{
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution
{
public:
vector<int> nextLargerNodes(ListNode *head)
{
vector<std::pair<int, int>> stack;
vector<int> ans;
int i = -1;
while (head != nullptr)
{
i++;
ans.push_back(0);
while (!stack.empty() && stack.back().first < head->val)
{
int index = stack.back().second;
stack.pop_back();
ans[index] = head->val;
}
stack.push_back(std::pair<int, int>(head->val, i));
head = head->next;
}
return ans;
}
};
void testNextLargerNodes()
{
Solution s;
ListNode *x3 = new ListNode(5, nullptr);
ListNode *x2 = new ListNode(1, x3);
ListNode *x1 = new ListNode(2, x2);
vector<int> o1 = {5, 5, 0};
ListNode *y5 = new ListNode(5, nullptr);
ListNode *y4 = new ListNode(3, y5);
ListNode *y3 = new ListNode(4, y4);
ListNode *y2 = new ListNode(7, y3);
ListNode *y1 = new ListNode(2, y2);
vector<int> o2 = {7, 0, 5, 5, 0};
EXPECT_TRUE(o1 == s.nextLargerNodes(x1));
EXPECT_TRUE(o2 == s.nextLargerNodes(y1));
EXPECT_SUMMARY;
}
int main()
{
testNextLargerNodes();
return 0;
}