6-7 链表逆置 (20 point(s))
本题要求实现一个函数,将给定单向链表逆置,即表头置为表尾,表尾置为表头。链表结点定义如下:
struct ListNode {
int data;
struct ListNode *next;
};
函数接口定义:
struct ListNode *reverse( struct ListNode *head );
其中head是用户传入的链表的头指针;函数reverse将链表head逆置,并返回结果链表的头指针。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
struct ListNode {
int data;
struct ListNode *next;
};
struct ListNode *createlist(); /裁判实现,细节不表/
struct ListNode *reverse( struct ListNode *head );
void printlist( struct ListNode *head )
{
struct ListNode *p = head;
while § {
printf("%d “, p->data);
p = p->next;
}
printf(”\n");
}
int main()
{
struct ListNode *head;
head = createlist();
head = reverse(head);
printlist(head);
return 0;
}
/* 你的代码将被嵌在这里 */
输入样例:
1 2 3 4 5 6 -1
输出样例:
6 5 4 3 2 1
Author
张泳
Organization
浙大城市学院
Code Size Limit
16 KB
Time Limit
400 ms
Memory Limit
64 MB
struct ListNode *reverse( struct ListNode *head )
{
struct ListNode *slow, *fast, *temp;//temp用来存储结点的,为了能遍历下去
if(head == NULL || head->next ==NULL)
return head;
slow = head;
fast = head->next;
while(fast != NULL){
temp = fast->next;
fast->next = slow;
slow = fast;
fast = temp;
}
head->next = NULL;//注意尾结点的设置,否则遍历时无停止标志了
return slow;
}