单链表建立测长打印

最新推荐文章于 2018-07-18 09:58:46 发布

原创最新推荐文章于 2018-07-18 09:58:46 发布 · 541 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#null #include #struct #input

本文介绍了一个简单的链表实现过程，包括链表的基本结构定义、创建链表的流程及如何计算链表长度，并展示了如何遍历打印链表中的元素。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <conio.h>

using namespace std;

typedef struct student
{
int data;
struct student *next;
}node;

node *creat()
{
node *head, *p, *s;
int x, cycle = 1;
head = (node*)malloc(sizeof(node));
p = head;

while( cycle )
{
printf("\nplease input the data:");
scanf("%d", &x);
if( x != 0 )
{
s = (node*)malloc(sizeof(node));
s->data = x;
printf("\n%d", s->data);
p->next = s;
p = s;
}
else
cycle = 0;
}
//......
}

int length( node *head )
{
node *p;
int n = 0;
p = head;
while( p != NULL )
{
p = p->next;
n++;
}

return n;
}

void print( node *head )
{
node *p;
int n;
n = length( head );
p = head;
if( head != NULL )
{
while(p != NULL)
{
printf("\n uuu %d ", p->data);
p = p->next;
}
}
}