/*STU stu;
stu.num = 1;
strcpy(stu.name, "dear");
printf("%d
%s
", stu.num, stu.name);
STU stu1;
stu1.num = 2;
strcpy(stu1.name, "小问题");
printf("%d
%s
", stu1.num, stu1.name);
STU stu[30];
for (int i = 0; i < 30; i++)
{
stu1.num = 2;
strcpy(stu1.name, "问题小了");
}*/
STU* pHead; //sizeof(int)
pHead = (STU*)malloc(sizeof(STU));
//void* malloc(Size); malloc动态开辟一块内存,这块内存的大小size,返回void*空指针类型
pHead->num = 2;
strcpy(pHead->name, "要慌");
printf("%d
%s
", pHead->num, pHead->name);
STU* pNew = (STU*)malloc(sizeof(STU));
pHead->pnext = pNew;
pNew->num = 1;
strcpy(pNew->name, "dear");
printf("%d
%s
", pHead->pnext->num, pHead->pnext->name);
链表:
链表:就是通过指针连接起来的一些内存空间。
其中每一个空间叫做一个节点。
最后一个空间的pnext是指向空的。