blob: a43dcfc1d4545bf6558dfb35e5e5d95b74598c72 (
plain) (
blame)
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
|
#include <climits>
#include <iostream>
#include <stack>
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:
ListNode* removeNodes(ListNode* node)
{
if (!node || !node->next)
return node;
std::stack<ListNode*> listNodes;
int maxValue = INT_MIN;
ListNode* iter = nullptr;
while (node)
{
listNodes.push(node);
node = node->next;
}
while (!listNodes.empty())
{
ListNode* currentNode = listNodes.top();
listNodes.pop();
if (currentNode->val >= maxValue)
{
maxValue = currentNode->val;
currentNode->next = iter;
iter = currentNode;
}
else
{
delete currentNode;
}
}
return iter;
}
};
void freeList(ListNode* node)
{
while (node)
{
ListNode* temp = node;
node = node->next;
delete temp;
}
}
int main()
{
Solution s;
ListNode* result =
s.removeNodes(new ListNode(5, new ListNode(2, new ListNode(13, new ListNode(3, new ListNode(8))))));
ListNode* toDelete = result;
while (result)
{
std::cout << result->val << " ";
result = result->next;
}
freeList(toDelete);
}
|
