单链表翻转

link_list_revert.c

#include <stdlib.h>
#include <stdio.h>

struct node {
    int item;
    struct node* next;
};

typedef struct node node;
typedef node * link_list;

void list_dump(link_list list)
{
    while (list) {
        printf("%d ", list->item);
        list = list->next;
    }
    printf("\n");
}

int main()
{
    link_list list = NULL;
    int i;
    for (i = 0; i < 10; i++) {
        node *n = (node *)malloc(sizeof(node));
        if (n) {
            n->item = i;
            n->next = list;
            list = n;
        } else {
            perror("molloc");
            return -1;
        }
    }
    list_dump(list);

    // revert
    if (!list) {
        return -1;
    }
    node *pre = NULL;
    node *cur = list;
    node *next = cur->next;
    while (next) {
        cur->next = pre;
        pre = cur;
        cur = next;
        next = cur->next;
    }

    cur->next = pre;
    list = cur;

    list_dump(list);
    return 0;
}