反转链表（数据结构）

#include<stdio.h>
struct ListNode* ReverseList(struct ListNode* head ) {
    // write code here
    struct ListNode* p1, *p2;
    if (head == NULL || head ->next == NULL) {
        return head;
    } else {
        p1 = head;
        p2 = head->next;
        head = p2->next;
        p2->next = p1;
        p1->next = NULL;
        while (head != NULL) {
            p1 = p2;
            p2 = head;
            head = p2->next;
            p2->next = p1;
        }
        return p2;
    }

}

输入：1 2 3

输出：3 2 1