C语言 链表 数据结构实验之链表一：顺序建立链表

数据结构实验之链表一：顺序建立链表

Problem Description

Input

Output

Example Input

8
12 56 4 6 55 15 33 62

Example Output

12 56 4 6 55 15 33 62

#include <stdio.h>
#include <stdlib.h>
struct sdut
{
int data;
struct sdut *next;
};
int main()
{
struct sdut *head, *q, *p, *t;
int i, n, a;
scanf("%d", &n);
head = NULL;
for(i = 1; i <= n; i++)
{
scanf("%d", &a);
p = (struct sdut *) malloc (sizeof (struct sdut));
p -> data = a;
p -> next = NULL;
if(head == NULL)
head = p;
else
q -> next = p;
q = p;
}
t = head;
while(t != NULL)
{
if(t -> next == NULL)
{
printf("%d", t -> data);
}
else
printf("%d ", t -> data);
t = t -> next;
}
return 0;
}

#include <stdio.h>
#include <stdlib.h>
struct sdut
{
int data;
struct sdut *next;
};
int main()
{
int n;
struct sdut *head, *p, *tail;
head = (struct sdut*)malloc(sizeof(struct sdut));
head -> next = NULL;
tail= head;
scanf("%d", &n);
int i;
for(i = 0; i < n; i++)
{
p = (struct sdut*)malloc(sizeof(struct sdut));
scanf("%d", &p -> data);
p -> next = NULL;
tail -> next = p;
tail = p;
}
p = head -> next;
while(p)
{
if(p -> next)
printf("%d ", p -> data);
else
printf("%d\n", p -> data);
p = p -> next;
}
return 0;
}