-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathTransposeSelfOrginizingList.cs
More file actions
67 lines (53 loc) · 1.62 KB
/
Copy pathTransposeSelfOrginizingList.cs
File metadata and controls
67 lines (53 loc) · 1.62 KB
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
namespace AlgorithmsAndDataStructures.DataStructures.SelfOrganizingList;
public class TransposeSelfOrginizingList<T>
{
private SelfOrganizingListNode<T> tail;
public SelfOrganizingListNode<T> Head { get; private set; }
public void Add(T value)
{
if (Head == null)
{
Head = new SelfOrganizingListNode<T> { Value = value };
tail = Head;
return;
}
tail.Next = new SelfOrganizingListNode<T> { Value = value };
tail = tail.Next;
}
public SelfOrganizingListNode<T> Get(T value)
{
if (Head == null) return null;
if (Head.Value.Equals(value)) return Head;
if (Head.Next == null) return null;
if (Head.Next.Value.Equals(value))
{
var tmp = Head.Next;
Head.Next = tmp.Next;
tmp.Next = Head;
Head = tmp;
return tmp;
}
var current = Head.Next.Next;
var prePrevious = Head;
var previous = Head.Next;
while (current != null)
{
if (current.Value.Equals(value))
{
Swap(prePrevious, previous, current);
return current;
}
prePrevious = previous;
previous = previous.Next;
current = previous.Next;
}
return null;
}
private static void Swap(SelfOrganizingListNode<T> prePrevious, SelfOrganizingListNode<T> previous,
SelfOrganizingListNode<T> current)
{
prePrevious.Next = current;
previous.Next = current.Next;
current.Next = previous;
}
}