蔡子经数据结构1.12

#include <stdlib.h>

typedef struct 
{
    int val;
    struct * next;
} node;

node* createNode()
{
    node *ret = (node*)malloc(sizeof(node));
    ret->val = 0;
    ret->next = NULL;
    return ret;
}

void reverse(node *head)
{
    node *p = head->next;
    head->next = NULL;

    while(p)
    {
        node *q = p;
        p = p->next;
        q->next = head->next;
        head->next = q;
    }
}

int main()
{
    node *head = createNode();
    node *tail = head;
    for(int i = 0; i < 10; ++i)
    {
        node *p = createNode();
        p->val = i+1;
        tail->next = p;
        tail = tail->next;
    }
    reverse(head);
    node *p = head->next;
    while(p)
    {
        printf("%d ",p->val);
        p = p->next;
    }
    puts("");
    return 0;
}