class Node {
int i;
Node next;
Node(int i, Node next){
this.i = i;
this.next = next;
}
public void display(Node node){
if (node.next == null) {
System.out.print(node.i);
System.out.println();
}else {
System.out.print(node.i);
display(node.next);
}
}
}
public static Node reverse(Node node){
if (node==null) {
return null;
}
Node pre = node,cur,next;
cur = node.next;
while (cur!=null) {
next = cur.next;
cur.next = pre;
pre = cur;
cur = next;
}
node.next = null;
node = pre;
return node;
}
public void init(){
Node node1 = new Node(1,new Node(2,new Node(3,new Node(4,null))));
node1.display(node1);
node1.display(reverse(node1));
}
public static void main(String[] args) {
TestNode testNode = new TestNode();
testNode.init();
}
反转单向链表
最新推荐文章于 2024-04-28 21:28:30 发布