[ÌÖÂÛ]´ó¼ÒÀ´¿´ÏÂ

ÉîË®º£¹·

#include<iostream.h>
typedef struct node
{
int music[5];
char name[10];
int i;
struct node *next;
};
void set(node *p)
{
p=new node;
node m1={{1,2,3,4,5},"СÃÛ·ä",1,NULL};
node *s1=new node;
s1=&m1;
p->next=s1;
node m2={{5,4,3,2,1},"Óö¼û",2,NULL};
node *s2=new node;
s2=&m2;
s1->next=s2;
}
int length(node *p)
{
int n=0;
node *q=p->next;
while(q!=NULL)
{
n++;
q=q->next;
}
return n;
}
void display(node *p)
{
int n=length(p),i;
node *q=p->next;
cout<<"¸èÇú¿âÏÔʾ\n";
for(i=1;i<=n;i++)
{
cout<<i<<'.'<<q->name<<endl;
q=q->next;
}
}
void main()
{
node hebe;
set(&hebe);
display(&hebe);
}
´ò»÷°ïæ¿´ÏÂ..±àÒëûÓÐÎÊÌâ..ÔËÐÐÀÏÊÇ˵ÎÒ·Ç·¨.лÁË.........

¥¸¨K‰ôÐ}‘Ù

#include<iostream.h>
typedef struct node
{
int music[5];
char name[10];
int i;
struct node *next;
};
void set(node *p)
{
node *s=new node;
s=p;
s->next=NULL;
node m1={{1,2,3,4,5},"СÃÛ·ä",1,NULL};
node *s1=new node;
s1=&m1;
s->next=s1;
node m2={{5,4,3,2,1},"Óö¼û",2,NULL};
node *s2=new node;
s2=&m2;
s1->next=s2;
}
int length(node *p)
{
int n=0;
node *q=p->next;
while(q!=NULL)
{
n++;
q=q->next;
}
return n;
}
void display(node *p)
{
int n=length(p),a;
node *q=p->next;
cout<<"¸èÇú¿âÏÔʾ\n";
for(a=1;a<=n;a++)
{
cout<<a<<'.'<<q->name<<endl;
q=q->next;
}
}
void main()
{
node hebe;
set(&hebe);
display(&hebe);
}

µ«ÊÇÕâÑù»¹ÊÇÓÐÔÆÀ´µÄÄǸöÎÊÌâ...

¡ïº£ÀË¡ï

void set(node *p)
{
p=new node;
//......
//p->next=s1;
}

int main()
{
node hehe;
set(&hebe);
}


p¿ªÊ¼ÊÇÖ¸Ïòhehe
¶øÄãÓÖ·ÖÅäÁËnode´óСµÄ¿Õ¼äÈÃp²»Ö¸Ïòhehe,¶øÖ¸Ïòheap space
ÕâÀïp²»Ö¸ÏòheheÁË,¶øÄãÔÚÉÏÃæset function²¿·ÖÓÖµ÷ÓÃÁËp->next=s1; ÕâÀïpÖ¸ÏòµÄ²¿·Ö(heap space)ûÓÐnext

ÎÂÈáÏç

°ïæ¿´Ï°¡..¿´ÁËÄÇô¶à¾ÍÊDz»ÁôÑÔ..ÄѵÀ¾ÍÕâôÄÑÂð?