Description
输入N个整数顺序建立一个单链表,将该单链表拆分成两个子链表,第一个子链表存放了所有的偶数,第二个子链表存放了所有的奇数。两个子链表中数据的相对次序与原链表一致。
Input
第一行输入整数N;;
第二行依次输入N个整数。
Output
第一行分别输出偶数链表与奇数链表的元素个数;
第二行依次输出偶数子链表的所有数据;
第三行依次输出奇数子链表的所有数据。
Sample
Input
10
1 3 22 8 15 999 9 44 6 1001
Output
4 6
22 8 44 6
1 3 15 999 9 1001
Hint
不得使用数组!
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int data;
struct node *next;
} List;
int sum1, sum2;
List *creator(int n)
{
List *head, *tail, *p;
head = new List;
head->next = NULL;
tail = head;
for(int i = 0; i < n; i++)
{
p = new List;
scanf("%d", &p->data);
p->next = NULL;
tail->next = p;
tail = p;
}
return head;
}
List *sqilt(List *head1)
{
List *head2, *tail1, *tail2, *p, *q;
p = head1->next;
head1->next = NULL;
q = p->next;
tail1 = head1;
head2 = new List;
head2->next = NULL;
tail2 = head2;
while(p)
{
if(p->data % 2 == 0)
{
sum1++;
p->next = NULL;
tail1->next = p;
tail1 = p;
}
else
{
sum2++;
p->next = NULL;
tail2->next = p;
tail2 = p;
}
p = q;
if(q)
q = q->next;
}
return head2;
}
void display(List *head)
{
List *p;
p = head->next;
while(p)
{
printf("%d%c", p->data, p->next ? ' ': '\n');
p = p->next;
}
}
int main()
{
int n;
sum1 = 0;
sum2 = 0;
scanf("%d", &n);
List *head1, *head2;
head1 = creator(n);
head2 = sqilt(head1);
printf("%d %d\n", sum1, sum2);
display(head1);
display(head2);
return 0;
}