-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSLL.java
More file actions
67 lines (57 loc) · 1.57 KB
/
Copy pathSLL.java
File metadata and controls
67 lines (57 loc) · 1.57 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
62
63
64
65
66
67
public class SLL{
public Node head;
public SLL() {
head = null;
}
// SLL methods go here. As a starter, we will show you how to add a node to the list.
public void add(int value) {
Node newNode = new Node(value);
if(head == null) {
head = newNode;
}
else {
Node runner = head;
while(runner.next != null) {
runner = runner.next;
}
runner.next = newNode;
}
}
public void remove() {
if(head == null) {
System.out.println("No nodes left to remove");
}
else {
Node runner = head;
while(runner.next.next != null) {
runner = runner.next;
}
runner.next = null;
}
}
public void printValues() {
Node runner = head;
while(runner != null) {
System.out.println(runner.value);
runner = runner.next;
}
}
public void find(int value) {
Node runner = head;
int counter = -1;
if(head == null){
System.out.println("No nodes my dude");
}
while(runner != null) {
counter += 1;
if (runner.value == value){
System.out.println("The value " + value + " exists at index of " + counter);
break;
}
else if(runner.next == null) {
System.out.println("That value doesnt exist mi compadre");
}
runner = runner.next;
}
}
}