鏈表數據結構
public static class Node {
private Node next;
private int data;
public Node(int data) {
this.data = data;
}
}
算法實現
public static Node reverse(Node currentNode) {
if (currentNode == null ||currentNode.next == null) {
return currentNode;
}
Node prev = null, next;
while (currentNode != null) {
next = currentNode.next;
currentNode.next = prev;
prev = currentNode;
currentNode = next;
}
return prev;
}
public static Node recursionReverse(Node currentNode) {
if (currentNode == null || currentNode.next == null) {
return currentNode;
}
Node newHead = recursionReverse(currentNode.next);
currentNode.next.next = currentNode;
currentNode.next = null;
return newHead;
}
打印節點信息
public static void print(Node node) {
while (node != null) {
System.out.printf(node.data + "->");
node = node.next;
}
System.out.println();
}
驗證
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);
Node node6 = new Node(6);
Node node7 = new Node(7);
node1.next = node2;
node2.next = node3;
node3.next = node4;
node4.next = node5;
node5.next = node6;
node6.next = node7;
print(node1);
print(reverse(node1));
}
1->2->3->4->5->6->7->
7->6->5->4->3->2->1->