forked from adnanaziz/EPIJudge
-
Notifications
You must be signed in to change notification settings - Fork 0
/
delete_from_list.cc
35 lines (30 loc) · 1.12 KB
/
delete_from_list.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
#include <memory>
#include "list_node.h"
#include "test_framework/generic_test.h"
#include "test_framework/timed_executor.h"
using std::shared_ptr;
// Delete the node past this one. Assume node is not a tail.
void DeleteAfter(const shared_ptr<ListNode<int>>& node) {
node->next = node->next->next;
}
shared_ptr<ListNode<int>> DeleteFromListWrapper(
TimedExecutor& executor, const shared_ptr<ListNode<int>>& head,
int node_idx) {
shared_ptr<ListNode<int>> selected_node = head;
shared_ptr<ListNode<int>> prev;
while (node_idx-- > 0) {
if (!selected_node || !selected_node->next)
throw std::runtime_error("Node index is out of range");
prev = selected_node;
selected_node = selected_node->next;
}
executor.Run([&] { DeleteAfter(prev); });
return head;
}
int main(int argc, char* argv[]) {
std::vector<std::string> args{argv + 1, argv + argc};
std::vector<std::string> param_names{"executor", "head", "node_idx"};
return GenericTestMain(args, "delete_from_list.cc", "delete_from_list.tsv",
&DeleteFromListWrapper, DefaultComparator{},
param_names);
}