forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNthNodeFromLast.java
75 lines (69 loc) · 2.17 KB
/
NthNodeFromLast.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
package com.rampatra.linkedlists;
import com.rampatra.base.SingleLinkedList;
import com.rampatra.base.SingleLinkedNode;
/**
* Created by IntelliJ IDEA.
*
* @author rampatra
* @since 6/18/15
*/
public class NthNodeFromLast {
/**
* @param list
* @param n
* @param <E>
* @return
*/
public static <E extends Comparable<E>> SingleLinkedNode<E> getNthNodeFromLast(SingleLinkedList<E> list, int n) {
SingleLinkedNode<E> slow = list.getNode(0);
SingleLinkedNode<E> fast = list.getNode(0);
// move the fast reference ahead of slow reference by 'n' nodes
for (int i = 0; i < n; i++) {
// assert length of linkedlist > n
fast = fast.next;
}
while (fast != null) {
slow = slow.next;
fast = fast.next;
}
return slow;
}
public static void main(String[] args) {
SingleLinkedList<Integer> linkedList = new SingleLinkedList<>();
linkedList.add(0);
linkedList.add(1);
linkedList.add(2);
linkedList.add(3);
linkedList.add(4);
linkedList.add(5);
linkedList.add(6);
linkedList.add(7);
linkedList.add(8);
linkedList.printList();
System.out.println("n=3: " + getNthNodeFromLast(linkedList, 3).item);
SingleLinkedList<Integer> linkedList2 = new SingleLinkedList<>();
linkedList2.add(0);
linkedList2.add(1);
linkedList2.add(2);
linkedList2.add(3);
linkedList2.add(4);
linkedList2.add(5);
linkedList2.add(6);
linkedList2.add(7);
linkedList2.add(8);
linkedList2.printList();
System.out.println("n=1: " + getNthNodeFromLast(linkedList2, 1).item);
SingleLinkedList<Integer> linkedList3 = new SingleLinkedList<>();
linkedList3.add(0);
linkedList3.add(1);
linkedList3.add(2);
linkedList3.add(3);
linkedList3.add(4);
linkedList3.add(5);
linkedList3.add(6);
linkedList3.add(7);
linkedList3.add(8);
linkedList3.printList();
System.out.println("n=9: " + getNthNodeFromLast(linkedList3, 9).item);
}
}