4.leetcode-反转链表

时间：2021-04-03 13:25:06 收藏：0 阅读：21

https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

/**

* Definition for singly-linked list.

* struct ListNode {

* int val;

* struct ListNode *next;

* };

struct ListNode* reverseList(struct ListNode* head){

struct ListNode *phead = NULL;

struct ListNode *pcur = head;

struct ListNode *pnext = NULL;

phead = (struct ListNode *)malloc(sizeof(struct ListNode));

memset(phead, 0, sizeof(struct ListNode));

while (pcur != NULL) {

pnext = pcur->next;

pcur->next = phead->next;

phead->next = pcur;

pcur = pnext;

}

return phead->next;

}

原文：https://www.cnblogs.com/chenfuzi-blogs/p/14613419.html