PTA 数据结构与算法题目集 6-1

List Reverse( List L ){
    List head = (List)malloc(sizeof(PtrToNode));
    head->Next = NULL;
    List cur = L,nNode;
    while(cur){
        nNode = cur->Next;
        cur->Next = head->Next;
        head->Next = cur;
        cur = nNode;
    }
    L = head->Next;
    return L;
}

/*反转单链表*/
List Reverse( List L ){
    List p1,p2;
    p1 = L;
    L = NULL;
    while(p1){
        p2 = p1;
        // 指向原来链表的指针后移
        p1 = p1->Next;
        p2->Next = L;
        L = p2;
    }
    return L;
}