#include<stdio.h>
#include<malloc.h>
#include<windows.h>
struct node
{
int no;
struct node * pNext;
};
int main()
{
int len,i;
struct node * pHead=NULL;
printf("请输入链表长度:");
scanf("%d",&len);
struct node * pTail=(struct node *)malloc(sizeof(struct node));
pHead=pTail;
pTail->pNext=NULL;
//创建单链表
for(i=0;i<len;i++)
{
struct node * pNew=(struct node *)malloc(sizeof(struct node));
scanf("%d",&pNew->no);
//每次循环都用一个pTail指针指向尾节点
pTail->pNext=pNew;
pNew->pNext=NULL;
pTail=pNew;
}
//遍历链表
struct node * p;
p=pHead->pNext;
while(NULL!=p)
{
printf("%d ",p->no);
p=p->pNext;
}
system("pause");
return 0;
}
链表操作
最新推荐文章于 2024-09-09 18:03:12 发布