本题要求实现一个函数,将给定单向链表逆置,即表头置为表尾,表尾置为表头。链表结点定义如下:
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 (p) {
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
题目集全集传送门
struct ListNode* reverse(struct ListNode* head)
{
struct ListNode* ptr1, * ptr2, * heado = NULL, * tail;
int a[100], index = 0;
for (ptr1 = head; ptr1 != NULL; ptr1 = ptr1->next)
a[index++] = ptr1->data;
for (int i = index - 1; i >= 0; i--)
{
ptr2 = (struct ListNode*)malloc(sizeof(struct ListNode));
ptr2->data = a[i];
ptr2->next = NULL;
if (heado == NULL)
heado = ptr2;
else
tail->next = ptr2;
tail = ptr2;
}
return heado;
}