Reverse Linked List(C++)

最新推荐文章于 2021-11-28 06:56:42 发布

不负初心

最新推荐文章于 2021-11-28 06:56:42 发布

阅读量512

点赞数

CC 4.0 BY-SA版权

分类专栏： Interview

本文链接：https://blog.youkuaiyun.com/himilong/article/details/49228121

Interview 专栏收录该内容

12 篇文章

订阅专栏

reverse singlely linked list

C++ Solution 1 - Iterative

ListNode reverseList(ListNode head)
{
    if(head == NULL)
            return head;
       ListNode *f, *m;
       f = head->next;
       head->next = NULL;
       while(f != NULL){
       m = f-> next;
       m->next = f;
       f = m;
     }
    head->next = f;
    return head;
}

C++ Solution 2 - Recursive

ListNode reverseList(ListNode head)
{
      if(head == NULL && head->next != NULL)
           return head;
       ListNode *f, *m;
       f = head->next;
      // head->next = NULL;

        m = reverseList(f);
        f->next = head;
       return m;
}