Leetcode 206. Reverse Linked list Reverse linked list

206. Reverse Linked List

Reverse a singly linked list.

Reverses a linked list.

Ideas:

Using the head interpolation method, the original linked list can be re-inserted once back.

The code is as follows:

/** * definition for singly-linked list. * struct listnode {  *     int val; *     ListNode *next;  *     listnode (int x)  : val (x),  next (NULL)  {} *  }; */class solution {public:    listnode* reverselist (ListNode*  head)  {        if (null == head)              return NULL;         listnode *newhead,*p,*q;        newhead->next  = NULL;        p = head;         while (P)         {              q = p;            p =  p->next;            q->next =  newHead->next;            newHead-> next = q;        }         return newHead->next;    }};

2016-08-05 18:59:32

This article is from the "Do Your best" blog, so be sure to keep this source http://qiaopeng688.blog.51cto.com/3572484/1834852

Leetcode 206. Reverse Linked list Reverse linked list