数据结构上机测试2-1:单链表操作A
Time Limit: 1000 ms
Memory Limit: 4096 KiB
Problem Description
输入n个整数,先按照数据输入的顺序建立一个带头结点的单链表,再输入一个数据m,将单链表中的值为m的结点全部删除。分别输出建立的初始单链表和完成删除后的单链表。
Input
第一行输入数据个数n;
第二行依次输入n个整数;
第三行输入欲删除数据m。
第二行依次输入n个整数;
第三行输入欲删除数据m。
Output
第一行输出原始单链表的长度;
第二行依次输出原始单链表的数据;
第三行输出完成删除后的单链表长度;
第四行依次输出完成删除后的单链表数据。
第二行依次输出原始单链表的数据;
第三行输出完成删除后的单链表长度;
第四行依次输出完成删除后的单链表数据。
Sample Input
10 56 25 12 33 66 54 7 12 33 12 12
Sample Output
10 56 25 12 33 66 54 7 12 33 12 7 56 25 33 66 54 7 33
Hint
Source
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct node{
int date;
struct node *next;
};
struct node* creat(struct node *head, int n){
struct node *p, *tail;
head = (struct node*)malloc(sizeof(struct node));
head -> next = NULL;
tail = head;
for(int i = 1; i <= n; i++){
p = (struct node *)malloc(sizeof(struct node));
scanf("%d", &p -> date);
p -> next = tail -> next;
tail -> next = p;
tail = p;
}
return head;
}
int delete_x(struct node *head, int k){
struct node *p, *q;
p = head;
int sum = 0;
q = p -> next;
while(q){
if(q -> date == k){
p -> next = q -> next;
q = q -> next;
sum++;
}
else{
p = p -> next;
q = q -> next;
}
}
return sum;
}
int main(){
int n, m, sum;
struct node *head, *p;
head = (struct node *)malloc(sizeof(struct node));
scanf("%d", &n);
head = creat(head, n);
cin>>m;
p = head -> next;
printf("%d\n", n);
while(p){
if(p == head -> next){
printf("%d", p -> date);
}
else printf(" %d", p -> date);
p = p -> next;
}
printf("\n");
sum = n - delete_x(head, m);
printf("%d\n", sum);
p = head -> next;
while(p){
if(p == head -> next){
printf("%d", p -> date);
}
else printf(" %d", p -> date);
p = p -> next;
}
printf("\n");
return 0;
}