单链表反转

被别人考过，也考过别人。今天动手写了，贴上来。

#include <stdio.h>

typedef struct _node {
    char value;
    _node * next;
}node;

node* rev_list(node* head){
    node * prev;
    node * post;
    prev = NULL;

    while(head) {
        post = head->next;
        head->next = prev;
        prev = head;
        head = post;
    }
return prev;
}

void print_list(node * head){

    while(head){
        printf("%c-->",head->value);
        head = head->next;
    }
    return;
}

void main () {
    node a;
    node b;
    node c;
    node d;
    node e;
    char tmp;
    a.value = 'a';
    a.next = &b;
    b.value = 'b';
    b.next = &c;
    c.value = 'c';
    c.next = &d;
    d.value = 'd';
    d.next = &e;
    e.value = 'e';
    e.next = 0;

    printf("Before revers:");
    print_list(&a);
    printf("\nAfter revers :");

    print_list(rev_list(&a));
    scanf("%c",&tmp);

}