Node* reveser(Node *head)
{
    if (head == NULL)
    {
        return NULL;
    }

    Node* pre = NULL;
    Node* next = NULL;
    while (head != NULL)
    {
        next = head->next;
        head->next = pre;
        head->pre = next;
        pre = head;
        head = next;
    }

    pre->pre = NULL;
    return pre;
}

 

相关文章:

  • 2021-07-19
  • 2022-12-23
  • 2021-06-22
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-10-14
  • 2021-10-21
  • 2022-12-23
相关资源
相似解决方案