一, 使用java实现单向链表
/**
* 封装的链表结构
*/
public class Node {
public int val;
public Node next;
public Node(int val){
this.val = val;
}
}
public static void main(String[] args) {
Node node1 = new Node(1);
Node node2 = new Node(2);
Node node3 = new Node(3);
Node node4 = new Node(4);
Node node5 = new Node(5);
node1.next = node2;
node2.next = node3;
node3.next = node4;
node4.next = node5;
Node node = reserveNode(node1);
System.out.println(node.val);//检测是否逆置成功
具体实现请参考 --------> 点击此处链接 !!!
二,进行链表逆置
public static Node reserveNode(Node node){//利用递归实现逆置
Node result = null;
if(node.next.next != null){
result = reserveNode(node.next);
}else {
result = node.next;
}
node.next.next = node;
node.next = null;
return result;
}