链表逆转

今天实现了单链表逆转的递归和非递归实现方法，把代码贴出来。

代码：

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
 
struct node {
    int v;
    struct node *next;
};
 
 
/*非递归逆转*/
int reverse(struct node **head)
{
    if(!head || !(*head)) return -1;
    struct node *pre, *cur, *nex;
    pre = NULL, cur=*head;
    while(cur) {
        nex = cur->next;
        cur->next = pre;
        pre = cur;
        cur = nex;
    }
    *head = pre;
    return 0;
}
 
 
/*递归逆转*/
struct node* reverse2(struct node* head)
{
    struct node *p1, *p2;
    if(!head || !(head->next)) return head;
    p1 = head;
    p2 = p1->next;
    head = reverse2(p2);
    p2->next = p1;
    p1->next = NULL;
    return head;
}
 
 
int printfList(struct node* head)
{
    struct node *p;
    p = head;
    while(p) {
        printf("%d\t", p->v);
        p = p->next;
    }
    printf("\n");
    return 0;
}
 
 
#if 1
/*test*/
int main()
{
    int i;
    struct node *head = NULL;
    struct node *p;
 
    for(i = 0; i < 16; i++) {
        if (head) {
            p = (struct node*) malloc(sizeof(*p));
            p->v = i;
            p->next = head;
            head = p;
        } else {
            head = (struct node*) malloc(sizeof(*head));
            head->next = NULL;
            head->v = i;
        }
    }
    printfList(head);
     
    reverse(&head);
    printfList(head);
     
    head = reverse2(head);
    printfList(head);
     
    return 0;
}
 
#endif

测试是可以的。

 
 
 
 
 
 
 
关注公众号"小败日记"，搬砖过程遇到的问题，大家一起探讨，资源共享