双向链表反序排列。
while(headNode != null)
{
tempNode = headNode.successorNode;
headNode.successorNode =headNode.previousNode
;
headNode.previousNode = tempNode;
if(tempNode == null)
{
return headNode;
}
headNode = tempNode;
}
successor n.1. 后继者,继任者;继承人[(+to)] 2. 后续的事物;接替的事物
单向链表的反序。
nextNode =null;
while(headNode!= null)
{
tempNode =headNode.successorNode;
headNode.successorNode =nextNode;
nextNode =headNode;
headNode =tempNode;
}
returnnextNode;