Linked-List/LeadSinglyLinkedList.java at master · sreeprasad/Linked-List · GitHub

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
public class LeadSinglyLinkedList {

public static void main(String abc[]){
		SList s = new SList();
		s.insertInFront(new Integer(11));
		s.insertInFront(new Integer(14));
		s.insertInFront(new Integer(14));
		s.insertInFront(new Integer(11));
		s.insertInFront(new Integer(12));
		s.insertInFront(new Integer(19));
		s.insertInFront(new Integer(14));

		/* all values */
		System.out.println(s.toString());

		System.out.println("after removing duplicates ");


		/* using hashtables */
		s.removeDuplicatesUsingHashTables();

		/* all values */
		System.out.println(s.toString());


			s.insertInFront(new Integer(11));
			s.insertInFront(new Integer(14));
			s.insertInFront(new Integer(14));
			s.insertInFront(new Integer(11));
			s.insertInFront(new Integer(12));
			s.insertInFront(new Integer(19));
			s.insertInFront(new Integer(14));

			System.out.println("after adding new items ");

			/* all values */
			System.out.println(s.toString());

			System.out.println("after removing duplicates ");

		/* removing duplicates without hashtable using runners */
		s.removeDuplicatesWithoutBufferUsingRunners();

		/* all values */
		System.out.println(s.toString());

		/* showing nth node from last. here n=3 */
		System.out.println("3 node from last is ");
		System.out.println((s.nthNodeFromLast(3)).toString());

		s.insertInFront(new Integer(16));

		/* all values */
		System.out.println(s.toString());

		/* delete a node in the middle of a single linked list, given only access to that node. */
		s.deleteFromMiddleGivenAccessOnlyToMidde(s.getMiddle());

		/* all values */
 		System.out.println(s.toString());


		SList a = new SList();
		SList b = new SList();
		a.insertInFront(new Integer(5));
		a.insertInFront(new Integer(1));
		a.insertInFront(new Integer(3));

		b.insertInFront(new Integer(2));
		b.insertInFront(new Integer(9));
		b.insertInFront(new Integer(5));
		System.out.println("a is value is "+a.toString());
		System.out.println("b is value is "+b.toString());

	  SList sum=	s.add(a,b);
	/* since result will be reverse order i reverse list and show */
	sum.reverse(sum.getHead());
	System.out.println("sum is "+sum.toString());


	}

}