Java实现单向链表反转

时间:2022-01-23 09:32:30

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

1、实现代码

?
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
public class linkedlisttest {
 
  public static void main(string[] args) {
    node a = new node("a");
    node b = new node("b");
    node c = new node("c");
    node d = new node("d");
    node e = new node("e");
    node f = new node("f");
    a.next = b;
    b.next = c;
    c.next = d;
    d.next = e;
    e.next = f;
    print(a);
 
    linkedlistreversor reversor = linkedlistreversor.recursion;
    system.out.println(reversor.getstrategy() + ":");
    node tmp = reversor.execute(a);
    print(tmp);
 
    reversor = linkedlistreversor.no_recursion;
    system.out.println(reversor.getstrategy() + ":");
    print(reversor.execute(tmp));
  }
 
  private static void print(node node) {
    while (node != null) {
      system.out.print(node.value);
      node = node.next;
      if (node != null) {
        system.out.print("->");
      } else {
        system.out.println();
      }
    }
  }
 
}
 
class node {
  public string value;
  public node next;
 
  public node(string value) {
    this.value = value;
  }
}
 
enum linkedlistreversor {
  recursion("递归") {
    @override
    public node execute(node node) {
      node prev = null;
      if (node == null || node.next == null) {
        prev = node;
      } else {
        node tmp = execute(node.next);
        node.next.next = node;
        node.next = null;
        prev = tmp;
      }
      return prev;
    }
  },
  no_recursion("非递归") {
    @override
    public node execute(node node) {
      node prev = null;
      while (node != null) {
        node tmp = node;
        node = node.next;
        tmp.next = prev;
        prev = tmp;
      }
      return prev;
    }
  };
  private string strategy;
 
  private linkedlistreversor(string strategy) {
    this.strategy = strategy;
  }
 
  public abstract node execute(node node);
 
  public string getstrategy() {
    return strategy;
  }
}

2、实现思路

递归:从尾部开始处理

Java实现单向链表反转

非递归:从头部开始处理

Java实现单向链表反转

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持服务器之家。

原文链接:https://www.cnblogs.com/hanxue112253/p/8533426.html