-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAppLinkedList.java
More file actions
61 lines (47 loc) · 1.19 KB
/
AppLinkedList.java
File metadata and controls
61 lines (47 loc) · 1.19 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
package crack.coding.interview;
import java.util.HashSet;
public class AppLinkedList {
class LinkedListNode {
int data;
LinkedListNode next;
}
void deleteDups(LinkedListNode head) {
HashSet<Integer> set = new HashSet<Integer>();
LinkedListNode previous = null ;
LinkedListNode current = head ;
while (current != null) {
if (set.contains(current.data)) {
previous.next = current.next;// important statement here
} else {
set.add(current.data);
previous = current;
}
current = current.next;
}
}
LinkedListNode getNthNodeFromTail(LinkedListNode head, int positionFromTail) {
if(head == null) {
return null;
}
LinkedListNode curr = head;
LinkedListNode node = head;
int count = 0;
while(curr.next != null) {
if(count >= positionFromTail) {
node = node.next;
}
count++;
curr = curr.next;
}
return node;
}
boolean deleteNode(LinkedListNode node) {
if(node == null || node.next == null) {
return false;
}
LinkedListNode next = node.next;
node.data = next.data;
node.next = next.next;
return true;
}
}