Java实现单向链表反转

小贝

本文实例为大家分享了Java实现单向链表反转的具体代码，供大家参考，具体内容如下

1、实现代码

2. public class LinkedListTest {
4. public static void main(String[] args) {
5. Node A = new Node("A");
6. Node B = new Node("B");
7. Node C = new Node("C");
8. Node D = new Node("D");
9. Node E = new Node("E");
10. Node F = new Node("F");
11. A.next = B;
12. B.next = C;
13. C.next = D;
14. D.next = E;
15. E.next = F;
16. print(A);
18. LinkedListReversor reversor = LinkedListReversor.RECURSION;
19. System.out.println(reversor.getStrategy() + ":");
20. Node tmp = reversor.execute(A);
21. print(tmp);
23. reversor = LinkedListReversor.NO_RECURSION;
24. System.out.println(reversor.getStrategy() + ":");
25. print(reversor.execute(tmp));
26. }
28. private static void print(Node node) {
29. while (node != null) {
30. System.out.print(node.value);
31. node = node.next;
32. if (node != null) {
33. System.out.print("->");
34. } else {
35. System.out.println();
36. }
37. }
38. }
40. }
42. class Node {
43. public String value;
44. public Node next;
46. public Node(String value) {
47. this.value = value;
48. }
49. }
51. enum LinkedListReversor {
52. RECURSION("递归") {
53. @Override
54. public Node execute(Node node) {
55. Node prev = null;
56. if (node == null || node.next == null) {
57. prev = node;
58. } else {
59. Node tmp = execute(node.next);
60. node.next.next = node;
61. node.next = null;
62. prev = tmp;
63. }
64. return prev;
65. }
66. },
67. NO_RECURSION("非递归") {
68. @Override
69. public Node execute(Node node) {
70. Node prev = null;
71. while (node != null) {
72. Node tmp = node;
73. node = node.next;
74. tmp.next = prev;
75. prev = tmp;
76. }
77. return prev;
78. }
79. };
80. private String strategy;
82. private LinkedListReversor(String strategy) {
83. this.strategy = strategy;
84. }
86. public abstract Node execute(Node node);
88. public String getStrategy() {
89. return strategy;
90. }
91. }

复制代码

2、实现思路

递归：从尾部开始处理

非递归：从头部开始处理

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持程序员之家。