c语言编程--c实现链表翻转

1.c语言中没有class（多态），只有struct ,因此节点选用struct表示

2. 链表翻转两种表达（递归/）

#include <stdio.h>  
#include <stdlib.h>  
  
struct node  
{  
    int val;  
    struct node *pNext;  
};  
//递归实现  
struct node * reverse(struct node *pHead)  
{  
    if (pHead == NULL || pHead -> pNext == NULL)  
    {     
        return pHead;  
    }     
    struct node *p = pHead -> pNext;  
    struct node *pNewHead =  reverse(p);  
    p -> pNext = pHead;  
    pHead ->pNext = NULL;  
    return pNewHead;  
}  
  
//尾递归实现  
struct node * do_reverse_tail(struct node *pHead, struct node *pNewHead)  
{  
    if(pHead == NULL)  
    {  
        return pNewHead;  
    }  
    else  
    {  
        struct node *pNext = pHead->pNext;  
        pHead->pNext = pNewHead;  
        return do_reverse_tail(pNext, pHead);  
    }  
}  
  
struct node * reverse_tail(struct node *pHead)  
{  
    return do_reverse_tail(pHead, NULL);  
}  
  
//迭代实现  
struct node * reverse_it(struct node *pHead)  
{  
    struct node *pNewHead = NULL;  
    struct node *pPrev = NULL;  
    struct node *pCur = pHead;  
    while(pCur != NULL)  
    {  
        struct node *pTmp = pCur->pNext;  
        if(pTmp == NULL)  
        {  
            pNewHead = pCur;  
        }  
        pCur->pNext = pPrev;  
        pPrev = pCur;  
        pCur = pTmp;  
    }  
  
    return pNewHead;  
}  
 int main()  
{  
    struct node *pHead = gen();  
    display(pHead);  
    pHead = reverse_it(pHead);  
    display(pHead);  
}