#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
int data;//数据域
struct Node* pNext;//指针域
}Node,* pNode;
pNode create_list(void);
void traverse_list(pNode pHead);
int main(void)
{
pNode pHead = NULL;
pHead = create_list();//创建非循环单列
traverse_list(pHead);//遍历链表所有的值
system("pause");
return 0;
}
pNode create_list(void)
{
int len;
int i;
int val;
pNode pTail;
pNode pNew;
pNode pHead;
pHead = (pNode)malloc(sizeof(Node));
if(NULL == pHead)
{
printf("分配失败,程序终止!");
exit(-1);
}
pTail = pHead;
pTail->pNext = NULL;//用pTail表示尾节点
printf("please input your num of nodes in the list:");
scanf("%d",&len);
for(i = 0; i < len; i++)
{
printf("please input the val of %dth node:",i+1);
scanf("%d",&val);
pNew = (pNode)malloc(sizeof(Node));
if(NULL == pHead)
{
printf("分配失败,程序终止!");
exit(-1);
}
pNew->data = val;
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;//保证每次pNew的值挂在尾节点上
}
return pHead;
}
void traverse_list(pNode pHead)
{
pNode p = pHead->pNext;
while(NULL != p)
{
printf("%d ",p->data);
p = p->pNext;
}
printf("\n");
}
#include <stdlib.h>
typedef struct Node
{
int data;//数据域
struct Node* pNext;//指针域
}Node,* pNode;
pNode create_list(void);
void traverse_list(pNode pHead);
int main(void)
{
pNode pHead = NULL;
pHead = create_list();//创建非循环单列
traverse_list(pHead);//遍历链表所有的值
system("pause");
return 0;
}
pNode create_list(void)
{
int len;
int i;
int val;
pNode pTail;
pNode pNew;
pNode pHead;
pHead = (pNode)malloc(sizeof(Node));
if(NULL == pHead)
{
printf("分配失败,程序终止!");
exit(-1);
}
pTail = pHead;
pTail->pNext = NULL;//用pTail表示尾节点
printf("please input your num of nodes in the list:");
scanf("%d",&len);
for(i = 0; i < len; i++)
{
printf("please input the val of %dth node:",i+1);
scanf("%d",&val);
pNew = (pNode)malloc(sizeof(Node));
if(NULL == pHead)
{
printf("分配失败,程序终止!");
exit(-1);
}
pNew->data = val;
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;//保证每次pNew的值挂在尾节点上
}
return pHead;
}
void traverse_list(pNode pHead)
{
pNode p = pHead->pNext;
while(NULL != p)
{
printf("%d ",p->data);
p = p->pNext;
}
printf("\n");
}