-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNthNodeFromLastinLINKEDLIST.java
107 lines (83 loc) · 2.28 KB
/
NthNodeFromLastinLINKEDLIST.java
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
public class NthNodeFromLastinLINKEDLIST {
Node head;
private int size;
NthNodeFromLastinLINKEDLIST() {
this.size = 0;
}
class Node {
int data;
Node next;
// Constructor:
Node(int data) {
this.data = data;
this.next = null;
size++;
}
}
public void addFirst(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
return;
}
newNode.next = head;
head = newNode;
}
public void addLast(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
return;
}
Node currentNode = head;
while (currentNode.next != null) {
currentNode = currentNode.next;
}
currentNode.next = newNode;
}
public void printList() {
if (head == null) {
System.out.println("The list is empty.");
return;
}
Node currentNode = head;
while (currentNode != null) {
System.out.print(currentNode.data + " --> ");
currentNode = currentNode.next;
}
System.out.print("NULL.\n");
}
public int getSize() {
return size;
}
public void nthNodeFromLast(int n) {
if (head == null) {
System.out.println("The list is empty.");
return;
}
// Using the two pointer technicque:
int currentPosition = n;
Node firstPointer = head;
Node secondPointer = head;
while (n > 0) {
secondPointer = secondPointer.next;
n--;
}
while (secondPointer != null) {
secondPointer = secondPointer.next;
firstPointer = firstPointer.next;
}
System.out.println(currentPosition + "th Node from the end is: " + firstPointer.data);
}
public static void main(String[] args) {
NthNodeFromLastinLINKEDLIST ll = new NthNodeFromLastinLINKEDLIST();
ll.addFirst(10);
ll.addLast(20);
ll.addLast(30);
ll.addLast(40);
ll.addLast(50);
ll.printList();
System.out.println(ll.getSize());
ll.nthNodeFromLast(3);
}
}