-
Notifications
You must be signed in to change notification settings - Fork 85
/
Copy pathLinkedListMap.java
131 lines (111 loc) · 2.17 KB
/
LinkedListMap.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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
package map;
/**
* 利用链表实现映射
*
* @author ronglexie
* @version 2018/8/19
*/
public class LinkedListMap<K,V> implements Map<K,V>{
/** 虚拟头节点*/
private Node dummyHead;
/** 链表大小*/
private int size;
public LinkedListMap() {
dummyHead = new Node(null,null,null);
size = 0;
}
@Override
public void add(K key, V value) {
Node node = getNode(key);
if(node != null){
throw new IllegalArgumentException("Add failed. key is exists!");
}
dummyHead.next = new Node(key,value,dummyHead.next);
size ++;
}
@Override
public V remove(K key) {
Node node = getNode(key);
if(node == null){
throw new IllegalArgumentException("Remove failed. key is not exists!");
}
Node prev = dummyHead;
while (prev.next != null){
if(prev.next.key.equals(key)){
break;
}
prev = prev.next;
}
if(prev.next != null){
Node delNode = prev.next;
prev.next = delNode.next;
delNode.next = null;
size --;
return delNode.value;
}
return null;
}
@Override
public boolean contains(K key) {
return getNode(key) != null;
}
@Override
public V get(K key) {
Node node = getNode(key);
return node != null ? node.value : null;
}
@Override
public void set(K key, V value) {
Node node = getNode(key);
if(node == null){
throw new IllegalArgumentException("Set failed. key is not exists!");
}
node.value = value;
}
@Override
public int getSize() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
/**
* 根据key获取Node
*
* @param key
* @return map.LinkedListMap<K,V>.Node
* @author ronglexie
* @version 2018/8/19
*/
private Node getNode(K key){
Node cur = dummyHead.next;
while (cur != null){
if(cur.key.equals(key)){
return cur;
}
cur = cur.next;
}
return null;
}
private class Node{
private K key;
private V value;
private Node next;
public Node(K key, V value, Node next) {
this.key = key;
this.value = value;
this.next = next;
}
public Node(K key) {
this.key = key;
}
public Node() {
this(null,null,null);
}
@Override
public String toString() {
return key.toString() + " : " + value.toString();
}
}
}