[LeetCode]206. Reverse Linked List 链表反转

Reverse a singly linked list.

click to show more hints.

Subscribe to see which companies asked this question

代码如下：

ListNode* reverseList(ListNode* head) {    if(head==NULL||head->next==NULL)return head;    ListNode *res,*newnode;    res=head;    head=head->next;    res->next=NULL;    while(head)    {    ListNode *temp=res;    newnode=head;    head=head->next;    newnode->next=temp;    res=newnode;        }    return newnode;    }