参考文献

Set

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
package com.holelin.set;

public interface Set<E> {
/**
* 添加元素e
*
* @param e 元素e
*/
void add(E e);

/**
* 删除元素e
*
* @param e 元素e
*/
void remove(E e);

/**
* 查询集合中是否包含元素e
*
* @param e 元素e
* @return 包含则返回true, 反之返回false
*/
boolean contains(E e);

/**
* 返回集合元素的个数
*
* @return 集合元素的个数
*/
int getSize();

/**
* 判断集合是否为空
*
* @return 为空返回true, 反之返回false;
*/
boolean isEmpty();
}

LinkedListSet

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
package com.holelin.set;

import com.holelin.linkedlist.LinkedList;

/**
* ClassName: LinkedListSet
*
* @author HoleLin
* @version 1.0
* @date 2019/2/11
*/

public class LinkedListSet<E extends Comparable<E>> implements Set<E> {
private LinkedList<E> mLinkedList;

public LinkedListSet() {
mLinkedList = new LinkedList<>();
}

@Override
public void add(E e) {
if (!mLinkedList.contains(e)) {
mLinkedList.addFirst(e);
}
}

@Override
public void remove(E e) {
mLinkedList.removeElement(e);
}

@Override
public boolean contains(E e) {
return mLinkedList.contains(e);
}

@Override
public int getSize() {
return mLinkedList.getSize();
}

@Override
public boolean isEmpty() {
return mLinkedList.isEmpty();
}
}

AVLSet

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
package com.holelin.set;

import com.holelin.tree.AVLTree;

/**
* ClassName: AVLSet
* 基于AVL树实现的Set
*
* @author HoleLin
* @version 1.0
* @date 2019/2/17
*/

public class AVLSet<E extends Comparable<E>> implements Set<E> {
private AVLTree<E, Object> mAVLTree;

public AVLSet() {
mAVLTree = new AVLTree<>();
}

@Override
public void add(E e) {
mAVLTree.add(e, null);
}

@Override
public void remove(E e) {
mAVLTree.remove(e);
}

@Override
public boolean contains(E e) {
return mAVLTree.contains(e);
}

@Override
public int getSize() {
return mAVLTree.getSize();
}

@Override
public boolean isEmpty() {
return mAVLTree.isEmpty();
}
}

BSTSet

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
package com.holelin.set;

import com.holelin.tree.BST;

/**
* ClassName: BSTSet
* 基于二分搜索树实现集合
*
* @author HoleLin
* @version 1.0
* @date 2019/2/11
*/

public class BSTSet<E extends Comparable<E>> implements Set<E> {

private BST<E> mBst;

public BSTSet() {
mBst = new BST<>();
}

@Override
public void add(E e) {
mBst.add(e);
}

@Override
public void remove(E e) {
mBst.remove(e);
}

@Override
public boolean contains(E e) {
return mBst.contains(e);
}

@Override
public int getSize() {
return mBst.size();
}

@Override
public boolean isEmpty() {
return mBst.isEmpty();
}
}