动态链表程序

#include <stdio.h>
#include <malloc.h>
struct weapon{
    int price;
    int atk;
    struct weapon *next;
};

struct weapon * creat_dynamic_chain(){
    struct weapon *p1,*p2,*head,*p,*x;
    int n=0;
    head= NULL;
    p1=p2= (struct weapon*)malloc(sizeof(struct weapon));
    scanf("%d,%d",&p1->price,&p1->atk);
    while(p1->price != 0){
        n++;
        if(n==1) head=p1;
	else    p2->next=p1;
	p2=p1;
        p1=(struct weapon*)malloc(sizeof(struct weapon));
    	scanf("%d,%d",&p1->price,&p1->atk);
    }
    p2->next=NULL;
    x=head;
    return (head);
}

int main()
{
   struct weapon *p,*head;
    head= p= creat_dynamic_chain();

       while(p->next != NULL)
	{
             printf("%d,%d\n",p->price,p->atk);
             p=p->next;
	}
       
             printf("%d,%d\n",p->price,p->atk);
              p=head; 
       //      printf("%d,%d\n",p->price,p->atk);

  return 0;
}