数据结构实验之链表一:顺序建立链表
Time Limit: 1000 ms
Memory Limit: 65536 KiB
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
#include<stdio.h> #include<stdlib.h> struct node { int date; struct node *next; }*p, *head, *q; int main() { int n; head = (struct node *)malloc(sizeof(struct node)); head -> next = NULL; q = head; scanf("%d", &n); while(n--) { p = (struct node *)malloc(sizeof(struct node)); scanf("%d", &p -> date); p -> next = NULL; q -> next = p; q = p; } q = head -> next; while(q != NULL) { printf("%d", q -> date); if(q -> next == NULL) { printf("\n"); } else printf(" "); q = q -> next; } return 0; }