问题描述:
Reverse a singly linked list.
分析:主要考察链表操作
代码如下:0ms
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head) {
struct ListNode *prev = NULL;
struct ListNode *next;
while(head){
next = head->next;
head->next = prev;
prev = head;
head = next;
}
return prev;
}