链表逆序算法，最简单的算法

    #include <stdio.h>  
    #include <stdlib.h>  
      
    typedef struct tagListNode{  
        int data;  
        struct tagListNode* next;  
    }ListNode, *List;  
      
    void PrintList(List head);  
    List ReverseList(List head);  
      
    int main()  
    {  
        //分配链表头结点  
        ListNode *head;  
        head = (ListNode*)malloc(sizeof(ListNode));  
        head->next = NULL;  
        head->data = -1;  
      
        //将[1,10]加入链表  
        int i;  
        ListNode *p, *q;  
        p = head;  
        for(int i = 1; i <= 10; i++)  
        {  
            q = (ListNode *)malloc(sizeof(ListNode));  
            q->data = i;  
            q->next = NULL;  
            p->next = q;  
            p = q;