传送门
题意解析:
注意此题中链表头结点含有数据,我们可以先把头结点取下来,然后遍历链表使得每一个元素都插在头结点前面,实现就地扭转链表。时间复杂度是O(n)空间复杂度O(1);
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head){
struct ListNode *p = head;
struct ListNode *s = NULL;
while(p != NULL){
struct ListNode *r = p->next;
p->next = s;
s = p;
p = r;
}
return s;
}