数据结构实验之链表一:顺序建立链表
Time Limit: 1000 ms Memory Limit: 65536 KiB
Submit Statistic
Problem Description
输入N个整数,按照输入的顺序建立单链表存储,并遍历所建立的单链表,输出这些数据。
Input
第一行输入整数的个数N;
第二行依次输入每个整数。
Output
输出这组整数。
Sample Input
8
12 56 4 6 55 15 33 62
Sample Output
12 56 4 6 55 15 33 62
Hint
不得使用数组!
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
void show(struct node*head)
{
struct node *p;
p = head->next;
while(p)
{
printf("%d%c", p->data, p->next==NULL? '\n': ' ');
p = p->next;
}
return;
}
int main()
{
struct node *head, *t;
head = (struct node*)malloc(sizeof(struct node));
head->next = NULL;
t = head;
int n;
scanf("%d", &n);
while(n--)
{
struct node*p;
p = (struct node*)malloc(sizeof(struct node));
p->next = NULL;
scanf("%d", &p->data);
t->next = p;
t = p;
}
show(head);
return 0;
}
/***************************************************
User name: jk160532姜兴友
Result: Accepted
Take time: 0ms
Take Memory: 168KB
Submit time: 2017-10-08 13:15:19
****************************************************/