static Node reverseLinkedList(Node node) {
    Node previousNode = null;
    Node currentNode = node;
    Node headNode = null;
    while (currentNode != null) {
        Node nextNode = currentNode.next;
        if (nextNode == null) {
            headNode = currentNode;
        }
        currentNode.next = previousNode;
        previousNode = currentNode;
        currentNode = nextNode;
    }
    return headNode;
}

 

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-08-15
  • 2022-12-23
猜你喜欢
  • 2021-07-03
  • 2021-10-24
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-09-22
  • 2021-06-30
相关资源
相似解决方案