算法分析（54页）

#include<stdio.h>
typedef struct LNode    {
    int data ;
    struct LNode *next ;
}LNode , *LinkList ;
int main()  {
    LinkList L ;
    LinkList p = new LNode ;
    L = p ;
    int i = 1 ;
    for(; i < 10 ; i++) {
        LinkList s = new LNode ;
        s->data = i ;
        p->next = s ;
        p = s;
    }
    p->next = NULL ;
    LinkList q = L ;
    p = L->next ;
    while(p&&p->next)   {
        LinkList r = p->next ;
        p->next = r->next ;
        r->next = q->next ;
        q->next = r ;
        q = q->next ;
        p = p->next ;
    }
    p = L->next ;
    while(p)    {
        printf("%d ",p->data) ;
        p = p->next ;
    }
    return 0 ;
}