-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked-list.cs
182 lines (167 loc) · 4.1 KB
/
linked-list.cs
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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
using System;
namespace Base
{
class Node<T>
{
public T value;
public Node<T> next;
public Node<T> prev;
public Node(T v, Node<T> p = null, Node<T> n = null)
{
this.value = v;
this.prev = p;
this.next = n;
}
}
class LinkedList<T>
{
public Node<T> head;
public Node<T> tail;
public uint length;
public LinkedList()
{
this.head = null;
this.length = 0;
this.tail = null;
}
public LinkedList(T value)
{
this.head = new Node<T>(value);
this.length = 1;
this.tail = null;
}
public void Add(T value)
{
if(this.head == null)
{
this.head = new Node(value);
}
else if(this.tail == NULL)
{
this.tail = new Node(value, this.head);
this.head.next = this.tail;
}
else
{
this.tail.next = new Node(value, this.tail);
this.tail = this.tail.next;
}
this.length ++;
}
public void Shift()
{
this.head = this.head.next;
this.length --;
}
public void Pop()
{
if(this.length == 1)
{
this.Shift();
}
else
{
this.tail.prev = null;
this.tail = this.tail.prev;
this.length --;
}
}
public void Remove(int n)
{
if(n < 0)
{
n = this.length + n;
}
if(this.length == 0)
{
throw new Exception("List is empty");
}
if(n >= this.length)
{
throw new Exception("Index is bigger than length");
}
if(n == 0)
{
this.Shift();
}
else if(n == this.length - 1)
{
this.Pop();
}
else if(n < this.length / 2)
{
Node<T> node = this.head;
for(int _ = 0; _ < n; _ ++)
{
node = node.next;
}
node.next.prev = node.prev;
node.prev.next = node.next;
this.length --;
}
else
{
Node<T> node = this.tail;
for(int _ = this.length - 1; _ > n; _ --)
{
node = node.prev;
}
node.next.prev = node.prev;
node.prev.next = node.next;
this.length --;
}
}
public void GetNode(int n)
{
if(n < 0)
{
n = this.length + n;
}
if(this.length == 0)
{
throw new Exception("List is empty");
}
if(n >= this.length)
{
throw new Exception("Index is bigger than length");
}
if(n == 0)
{
return this.head;
}
else if(n == this.length - 1)
{
return this.tail;
}
else if(n < this.length / 2)
{
Node<T> node = this.head;
for(int _ = 0; _ < n; _ ++)
{
node = node.next;
}
return node;
}
else
{
Node<T> node = this.tail;
for(int _ = this.length - 1; _ > n; _ --)
{
node = node.prev;
}
return node;
}
}
public void Get(int n)
{
return this.GetNode(n);
}
}
class Program
{
public static void Main()
{
Console.ReadLine();
}
}
}