public GetCircularStartNodeInList(LinkedList list)
{
if (list == null) {
throw new ArgumentNullException("List can not be null");
}
this.Lst = list;
}
static void TestRemoveNodeFromLinkedList()
{
Node head = new Node (1);
LinkedList list = new LinkedList (head);
list.AppendNewNode (new Node (2));
list.AppendNewNode (new Node (3));
list.AppendNewNode (new Node (4));
Node five = new Node(5);
list.AppendNewNode (five);
list.AppendNewNode (new Node (2));
list.AppendNewNode (new Node (7));
list.AppendNewNode (new Node (8));
list.ToString ();
//Node newHead = head.DeleteSelfFromLinkedList ();
//while (newHead!=null) {
// Console.Write(newHead.Data);
// Console.Write(" ");
// newHead = newHead.Next;
//}
//Console.WriteLine(" ");
five.DeleteSelfFromLinkedList();
list.ToString();
//Test single node list
Node one = new Node(2);
LinkedList list2 = new LinkedList(one);
list2.Head = one.DeleteSelfFromLinkedList();
list2.ToString();
}
static void TestListAddition()
{
LinkedList list1 = new LinkedList(new List<Node>{
new Node(3),
new Node(0),
new Node(5)
});
list1.ToString();
LinkedList list2 = new LinkedList(new List<Node>{
new Node(7),
//new Node(0),
//new Node(3)
});
list2.ToString();
var test1 = new ListAddition(list1, list2);
test1.Run();
}
//Chapter 2
static void TestLinkedList()
{
Node head= new Node(1);
LinkedList list = new LinkedList(head);
list.AppendNewNode(new Node(2));
list.AppendNewNode(new Node(3));
list.AppendNewNode(new Node(4));
list.AppendNewNode(new Node(5));
list.AppendNewNode(new Node(2));
list.AppendNewNode(new Node(7));
list.AppendNewNode(new Node(8));
list.ToString();
list.RemoveDuplicateNode();
list.ToString();
list.AppendNewNode(new Node(2));
list.AppendNewNode(new Node(7));
list.ToString();
list.RemoveDuplicateNodeWithoutHashTable();
list.ToString();
//Find the Node which is Nth to the last node
Node result = list.FindTheNthToLastNode(4);
Console.WriteLine(result.Data);
result = list.FindTheNthToLastNode(14);
Console.WriteLine(result == null);
result = list.FindTheNthToLastNode(0);
Console.WriteLine(result.Data);
result = list.FindTheNthToLastNode(1);
Console.WriteLine(result.Data);
Node s = null;
LinkedList list2 = new LinkedList(s);
result = list2.FindTheNthToLastNode(2);
Console.WriteLine(result == null);
}
static void TestCircularList()
{
Node start = new Node (99);
LinkedList list1 = new LinkedList (new List<Node>{
new Node(3),
new Node(0),
new Node(5),
new Node(6),
new Node(7),
new Node(9),
new Node(12),
new Node(33),
new Node(11),
new Node(13),
new Node(54)
});
var list = new List<Node>{
new Node(3),
new Node(0),
new Node(5),
new Node(6),
new Node(7),
new Node(9),
new Node(12),
new Node(33),
new Node(11),
new Node(13),
new Node(54),
};
Node h = list1.Head;
while (h.Next!=null) {
h = h.Next;
}
h.Next = start;
h = h.Next;
foreach (var node in list) {
h.Next = node;
h=h.Next;
}
h.Next = start;
var test1 = new GetCircularStartNodeInList(list1);
test1.Run();
}
public ListAddition(LinkedList list1, LinkedList list2)
{
listOne = list1;
listTwo = list2;
}
