8000 修改部分方法签名 · ssjssh/javaalgorithm@1f4374f · GitHub
[go: up one dir, main page]

Skip to content
8000

Commit 1f4374f

Browse files
author
shengshijun
committed
修改部分方法签名
1 parent aeb79ea commit 1f4374f

File tree

3 files changed

+63
-6
lines changed

3 files changed

+63
-6
lines changed

src/main/java/ssj/algorithm/Graph.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -23,17 +23,17 @@ public interface Graph<T> {
2323

2424
<R> Vector<R> bfs(Function<? super T, ? extends R> func);
2525

26-
Vector<T> next(T ele);
26+
List<T> next(T ele);
2727

2828
void topologicalSort(Consumer<? super T> func);
2929

30-
<R> Vector<R> topologicalSort(Function<? super T, ? extends R> func);
30+
<R> List<R> topologicalSort(Function<? super T, ? extends R> func);
3131

3232
int size();
3333

3434
public default boolean isEmpty() {
3535
return size() <= 0;
3636
}
3737

38-
Vector<T> shortestPath(T from, T to);
38+
List<T> shortestPath(T from, T to);
3939
}

src/main/java/ssj/algorithm/collections/BPlusTree.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,11 +7,10 @@
77
/**
88
* Created by shenshijun on 15/2/5.
99
*/
10-
public class BplusTree<T extends Comparable<T>> implements SearchTree<T> {
10+
public class BplusTree<T extends Comparable<? super T>> implements SearchTree<T> {
1111
//Todo 完成B+树
1212
@Override
1313
public void add(T ele) {
14-
1514
}
1615

1716
@Override
Lines changed: 59 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,65 @@
11
package ssj.algorithm.collections;
22

3+
import ssj.algorithm.SearchTree;
4+
5+
import java.util.Iterator;
6+
37
/**
48
* Created by shenshijun on 15/2/5.
59
*/
6-
public class RedBlackTree {
10+
public class RedBlackTree<T extends Comparable<? super T>> implements SearchTree<T>{
11+
@Override
12+
public void add(T ele) {
13+
14+
}
15+
16+
@Override
17+
public int size() {
18+
return 0;
19+
}
20+
21+
@Override
22+
public Iterator<T> preIterator() {
23+
return null;
24+
}
25+
26+
@Override
27+
public Iterator<T> postIterator() {
28+
return null;
29+
}
30+
31+
@Override
32+
public void delete(T ele) {
33+
34+
}
35+
36+
@Override
37+
public T max() {
38+
return null;
39+
}
40+
41+
@Override
42+
public T min() {
43+
return null;
44+
}
45+
46+
@Override
47+
public T kthElement(int k) {
48+
return null;
49+
}
50+
51+
@Override
52+
public boolean contains(T ele) {
53+
return false;
70A3 54+
}
55+
56+
@Override
57+
public boolean isBalance() {
58+
return false;
59+
}
60+
61+
@Override
62+
public Iterator<T> iterator() {
63+
return null;
64+
}
765
}

0 commit comments

Comments
 (0)
0