데이터 구조 - 링크 역순 저장

#include 
#include 

typedef struct _Node
{
    _Node * next;
    int data;
}Node, * pNode;


void print_node(pNode head)
{
    pNode pIter=head;
    while(pIter)
    {
        printf("%d ", pIter->data);
        pIter=pIter->next;
    }
    printf("
");
}

void invert(pNode head)
{
    pNode currentNode;  //      
    pNode nextNode;     //       

    pNode tempHead=new Node;
    tempHead->next=head;

    //   ,p         ，head->next=NULL，         
    currentNode=tempHead->next;
    tempHead->next=NULL;
    
    printf("begin invert in func:
");
    //  
    while(currentNode)
    {
        nextNode=currentNode->next;
        currentNode->next=tempHead->next;
        tempHead->next=currentNode;
        currentNode=nextNode;
        //   
        print_node(tempHead);
    }

    //       head      （    ），  head    
    /*??&head=&(tempHead->next);??*/
    head=tempHead->next;
    printf("after invert in func:
");
    print_node(head);
}


void main()
{
    pNode head=new Node;
    head->data=1;
    head->next=NULL;
    for(int i=4; i>1; i--)
    {
        pNode tempNode=new Node;
        tempNode->data=i;
        tempNode->next=head->next;
        head->next=tempNode;
    }
    printf("before invert in main:
");
    print_node(head);
    invert(head);
    printf("after invert in main:
");
    print_node(head);
}