题目:输入一个链表头,反转链表并返回反转后的链表头
/*
* 链表格式
*/
typedef struct List{ int i_Value; struct List *p_Next; }T_List, *PT_List; /* 链表头 */ PT_List g_ptListHead;
/*
* 功能 :反转链表,并返回反转后的头结点
* 输入 :链表头
* 返回值:反转后的链表头
*/ PT_List ReverseList(PT_List ptListHead) { PT_List ReverseListHead = NULL; PT_List ptPer = NULL; PT_List ptCur = ptListHead; PT_List ptNext = NULL; while (ptCur != NULL) { ptNext = ptCur->p_Next; if (ptNext == NULL) ReverseListHead = ptNext; ptCur->p_Next = ptPer; ptPer = ptCur; ptCur = ptNext; } return ReverseListHead; }
原文:https://www.cnblogs.com/lcsgj/p/13067664.html