-
Notifications
You must be signed in to change notification settings - Fork 0
/
DumbList.java~
103 lines (80 loc) · 2.16 KB
/
DumbList.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
/*
* DumbList.java
*
* This is an unordered list of articles. Dumb, dumb, dumb. You will rewrite this as a hash table.
*
* Author: Alexander Breen ([email protected]) and Wayne Snyder ([email protected])
* Date: March 24, 2014
*/
public class DumbList {
public static class Node {
public Article data;
public Node next;
public Node(Article data, Node n) {
this.data = data;
this.next = n;
}
public Node(Article data) {
this(data, null);
}
}
public Node root = null;
public void initialize(Article[] A) {
for(int i = 0; i < A.length; ++i)
add(A[i]);
}
public void add(Article a) {
root = new Node(a, root);
}
public boolean member(Article a) {
return (lookup(root,a.getTitle()) != null);
}
public boolean member(String title) {
return (lookup(root,title) != null);
}
public Article lookup(String title) {
Node n = lookup(root,title);
if(n != null)
return n.data;
return null;
}
private Node lookup(Node t, String key) {
if (t == null)
return null;
else if (key.compareTo(t.data.getTitle()) == 0) {
return t;
} else
return lookup(t.next,key);
}
public Node lookup(Node t, Article a) {
if (t == null)
return null;
else if (a.getTitle().compareTo(t.data.getTitle()) == 0) {
return t;
} else
return lookup(t.next, a);
}
public void remove(String t) {
root = delete(t, root);
}
public int length() {
return length(root);
}
private int length(Node t) {
if(t == null)
return 0;
else
return 1 + length(t.next);
}
// Recursively reconstructs list without the key n in it
public Node delete(String title, Node t) {
if (t == null) // Case 1: tree is null
return t;
else if (title.compareTo(t.data.getTitle()) == 0)
return t.next;
else {
t.next = delete(title, t.next);
return t;
}
}
}