链表的结构、生成与打印

struct Node

{

Node():val(0),next(NULL){}

int val;

Node *next;

};

Node* Create(int n)

{

srand(time(NULL));

Node* head=NULL, *next;

for(int i=0;i<n; i++)

{

Sleep(10);

if(head==NULL)

{

head=new Node();

head->val=rand()%1000;

head->next=NULL;

 

next=head;

}

else

{

Node* end=new Node();

end->val=rand()%1000;

end->next=NULL;

 

next->next=end;

next=end;

}

}

 

return head;

}

 

void Print(Node* head)

{

while(head)

{

cout<<head->val<<"\t";

head=head->next;

}

cout<<endl;

}