1
+ package com .crossoverjie .algorithm ;
2
+
3
+ import org .junit .Test ;
4
+ import static com .crossoverjie .algorithm .ReverseNode .Node ;
5
+
6
+ public class ReverseNodeTest {
7
+
8
+ @ Test
9
+ public void reverseNode1 () throws Exception {
10
+ ReverseNode .Node <String > node4 = new Node <>("4" ,null ) ;
11
+ Node <String > node3 = new Node <>("3" ,node4 );
12
+ Node <String > node2 = new Node <>("2" ,node3 );
13
+ Node <String > node1 = new Node ("1" ,node2 ) ;
14
+
15
+ ReverseNode reverseNode = new ReverseNode () ;
16
+ reverseNode .reverseNode1 (node1 );
17
+ }
18
+
19
+ @ Test
20
+ public void reverseNode12 () throws Exception {
21
+
22
+ Node <String > node1 = new Node ("1" ,null ) ;
23
+
24
+ ReverseNode reverseNode = new ReverseNode () ;
25
+ reverseNode .reverseNode1 (node1 );
26
+ }
27
+
28
+ @ Test
29
+ public void reverseNode13 () throws Exception {
30
+
31
+ Node <String > node1 = null ;
32
+
33
+ ReverseNode reverseNode = new ReverseNode () ;
34
+ reverseNode .reverseNode1 (node1 );
35
+ }
36
+
37
+
38
+ /**
39
+ * 头插法
40
+ * @throws Exception
41
+ */
42
+ @ Test
43
+ public void reverseHead21 () throws Exception {
44
+ Node <String > node4 = new Node <>("4" ,null ) ;
45
+ Node <String > node3 = new Node <>("3" ,node4 );
46
+ Node <String > node2 = new Node <>("2" ,node3 );
47
+ Node <String > node1 = new Node ("1" ,node2 ) ;
48
+
49
+ ReverseNode reverseNode = new ReverseNode () ;
50
+ reverseNode .reverseNode (node1 );
51
+
52
+ }
53
+
54
+
55
+ @ Test
56
+ public void recNodeTest31 (){
57
+ Node <String > node4 = new Node <>("4" ,null ) ;
58
+ Node <String > node3 = new Node <>("3" ,node4 );
59
+ Node <String > node2 = new Node <>("2" ,node3 );
60
+ Node <String > node1 = new Node ("1" ,node2 ) ;
61
+
62
+ ReverseNode reverseNode = new ReverseNode () ;
63
+ reverseNode .recNode (node1 );
64
+ }
65
+
66
+ }
0 commit comments