集合
集合实现接口
public interface Set<E> {
void add(E e);
void remove(E e);
boolean contains(E e);
int getSize();
boolean isEmpty();
}
利用BSTSet实现
集合时间复杂度
LinkedListSet 实现 | BSTSet 实现 | 平均 | |
---|---|---|---|
增 add | O(n) | O(h) | O(logn) |
查 contains | O(n) | O(h) | O(logn) |
删 remove | O(n) | O(h) | O(logn) |
public class BSTSet<E extends Comparable<E>> implements Set<E> {
private BST<E> bst;
public BSTSet() {
bst = new BST<E>();
}
@Override
public void add(E e) {
bst.add(e);
}
@Override
public void remove(E e) {
bst.remove(e);
}
@Override
public boolean contains(E e) {
return bst.contains(e);
}
@Override
public int getSize() {
return bst.size();
}
@Override
public boolean isEmpty() {
return bst.isEmpty();
}
}
映射
映射Map实现接口
public interface Map<K, V> {
void add(K key, V value);
V remove(K key);
boolean contains(K key);
V get(K key);
void set(K key, V newValue);
int getSize();
boolean isEmpty();
}
LinkedListMap实现
映射的时间复杂度
LinkedListMap 实现 | BSTMap 实现 | 平均 | |
---|---|---|---|
增 add | O(n) | O(h) | O(logn) |
删 remove | O(n) | O(h) | O(logn) |
改 set | O(n) | O(h) | O(logn) |
查 get | O(n) | O(h) | O(logn) |
查 contains | O(n) | O(h) | O(logn) |
public class LinkedListMap<K,V> implements Map<K,V> {
private class Node {
public K key;
public V value;
public 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, null, null);
}
public Node() {
this(null, null, null);
}
@Override
public String toString() {
return key.toString() + ":" + value.toString();
}
}
private Node dummyHead;
private int size;
public LinkedListMap() {
dummyHead = new Node();
size = 0;
}
private Node getNode(K key) {
Node cur = dummyHead.next;
while (cur != null) {
if(cur.key.equals(key))
return cur;
cur = cur.next;
}
return null;
}
@Override
public void add(K key, V value) {
Node node = getNode(key);
if (node == null) {
dummyHead.next = new Node(key, value, dummyHead.next);
size ++;
}
else //重复的键值,也可以直接抛出异常
node.value = value;
}
@Override
public V remove(K key) {
Node prev = dummyHead;
while (prev.next != null){
if (prev.next.key.equals(key))
break; //跳出while循环
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 ? null : node.value;
}
@Override
public void set(K key, V newValue) { //键赋新的值
Node node = getNode(key);
if(node == null)
throw new IllegalArgumentException(key + "doesn't exist!");
node.value = newValue;
}
@Override
public int getSize() {
return size;
}
@Override
public boolean isEmpty() {
return size==0;
}
}
BSTMap实现
public class BSTMap<K extends Comparable<K>, V> implements Map<K, V>{
private class Node{
public K key;
public V value;
public Node left,right;
public Node(K key, V value) {
this.key = key;
this.value = value;
left = null;
right = null;
}
}
private Node root;
private int size;
public BSTMap() {
root = null;
size = 0;
}
// 返回以node为根节点的二分搜索树中,key所在的节点
private Node getNode(Node node, K key) {
if(node == null)
return null;
if (key.compareTo(node.key) == 0)
return node;
else if(key.compareTo(node.key) < 0)
return getNode(node.left, key);
else
return getNode(node.right, key);
}
@Override
//二分搜索树添加新的元素(key, value)
public void add(K key, V value) {
root = add(root, key, value);
}
//向以node为根的二分搜索树中插入元素(key, value),递归算法
//返回插入新节点后二分搜索树的根
private Node add(Node node, K key, V value){
if (node == null){
size ++;
return new Node(key, value);
}
if(key.compareTo(node.key) < 0 ) {
node.left = add(node.left, key, value);
}
else if (key.compareTo(node.key) > 0) {
node.right = add(node.right, key, value);
}
else //key.compareTo(node.key) > 0
node.value = value;
return node;
}
//返回以node为根的二分搜索树的最小值所在的节点
private Node minimum(Node node) {
if(node.left == null)
return node;
return minimum(node.left);
}
//删除掉以node为根的二分搜索树中的最小节点
// 返回删除节点后新的二分搜索树的根
private Node removeMin(Node node) {
if (node.left == null){
Node rightNode = node.right;
node.right = null;
size --;
return rightNode;
}
node.left = removeMin(node.left);
return node;
}
// 从二分搜索树中删除键为key的节点
@Override
public V remove(K key) {
Node node = getNode(root, key);
if (node != null){
root = remove(root, key);
return node.value;
}
return null;
}
private Node remove(Node node, K key) {
if (node == null)
return null;
if (key.compareTo(node.key) < 0) {
node.left = remove(node.left, key);
return node;
}
else if (key.compareTo(node.key) > 0) {
node.right = remove(node.right, key);
return node;
}
else {
// 待删除节点左子树为空的情况
if (node.left == null) {
Node rightNode = node.right;
node.right = null;
size --;
return rightNode;
}
// 待删除节点右子树为空的情况
if (node.right == null) {
Node leftNode = node.left;
node.left = null;
size --;
return leftNode;
}
// 待删除节点左右子树均不为空的情况
// 找到比待删除节点大的最小节点, 即待删除节点右子树的最小节点
// 用这个节点顶替待删除节点的位置
Node successor = minimum(node.right);
successor.right = removeMin(node.right);
successor.left = removeMin(node.left);
node.left = node.right = null;
return successor;
}
}
@Override
public boolean contains(K key) {
return getNode(root, key) != null;
}
@Override
public V get(K key) {
Node node = getNode(root, key);
return node == null ? null : node.value;
}
@Override
public void set(K key, V newValue) {
Node node = getNode(root, key);
if(node == null)
throw new IllegalArgumentException(key + " doesn't exist!");
node.value = newValue;
}
@Override
public int getSize() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
}
有序映射和无序映射
有序映射
中的键具有顺序性 ← 基于搜索树
的实现无序映射
中的键没有顺序性 ← 基于哈希表
的实现