示意图
代码实现
- #include<stdio.h>
- struct ListNode{
- int data;
- ListNode *next;
- }
- ListNode* reverse(ListNode* head){
- ListNode *p,*tmp ;
- p = head->next;
- head->next=NULL;
- while(p){
- tmp = p->next; //图1 保存p->next
- p->next = head; //图1 反向指向head
- head = p ; //图2 head 指向p
- p = tmp; //图2 p指向p->next
- }
- return head;
- }
- #include <stdio.h>
- #include <stdlib.h>
- struct node
- {
- int val;
- struct node *pNext;
- };
- struct node *gen()
- {
- struct node *pHead = NULL;
- for(int i = 10; i > 0; i--){
- struct node * p = (struct node *)malloc(sizeof(struct node));
- p -> val = i;
- p -> pNext = pHead;
- pHead = p;
- }
- return pHead;
- }
- void display(struct node *pHead)
- {
- while( pHead != NULL)
- {
- printf("%d ", pHead->val);
- pHead = pHead->pNext;
- }
- printf("\n");
- }
- //递归实现
- 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);
- }