本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中奇数值的结点重新组成一个新的链表。链表结点定义如下:
struct ListNode {
int data;
ListNode *next;
};
函数接口定义:
struct ListNode *readlist();
struct ListNode *getodd( struct ListNode **L );
函数readlist从标准输入读入一系列正整数,按照读入顺序建立单链表。当读到−1时表示输入结束,函数应返回指向单链表头结点的指针。
函数getodd将单链表L中奇数值的结点分离出来,重新组成一个新的链表。返回指向新链表头结点的指针,同时将L中存储的地址改为删除了奇数值结点后的链表的头结点地址(所以要传入L的指针)。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
struct ListNode {
int data;
struct ListNode *next;
};
struct ListNode *readlist();
struct ListNode *getodd( struct ListNode **L );
void printlist( struct ListNode *L )
{
struct ListNode *p = L;
while (p) {
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int main()
{
struct ListNode *L, *Odd;
L = readlist();
Odd = getodd(&L);
printlist(Odd);
printlist(L);
return 0;
}
/* 你的代码将被嵌在这里 */
输入样例:
1 2 2 3 4 5 6 7 -1
输出样例:
1 3 5 7
2 2 4 6
题解:
struct ListNode *readlist()
{
struct ListNode *head = NULL, *p, *last;
int n;
last = head;
do{
scanf("%d", &n);
if(n != -1)
{
p = (struct ListNode *)malloc(sizeof(struct ListNode));
p -> data = n;
p -> next = NULL;
if(last == NULL)
head = p;
else
last -> next = p;
last = p;
}
else
break;
}while(n != -1);
return head;
}
struct ListNode *getodd( struct ListNode **L )
{
struct ListNode *odd = NULL, *last, *p, *q, *k;
last = odd;
q = NULL;
p = *L;
while(p)
{
if((p -> data) % 2)
{
if(q && p != *L)
{
k = p;
q -> next = p-> next;
if(last != NULL)
last -> next = k;
else
odd = k;
last = k;
}
else
{
k = p;
*L = p -> next;
if(last != NULL)
last -> next = k;
else
odd = k;
last = k;
}
}
else
q = p;
p = p -> next;
if(last)
last -> next = NULL;
}
return odd;
}