一:一个指针
这种方法虽然可以,但是效率很低,总是频繁的申请和释放节点,会有很大的开销
#include "list.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
void Reverse_1(List plist)
{
assert(plist != NULL);
if (plist == NULL || plist->next == NULL || plist->next->next == NULL)
{
return;
}
Node* p = plist->next;
plist->next = NULL;
while (p != NULL)
{
int val = p->data;
Node *q = p;
p = p->next;
free(q);
Insert_head(plist, val);
}
}
测试:
int main()
{
Node tail;
InitList(&tail);
for (int i = 0; i < 10; i++)
{
Insert_tail(&tail, i + 1);
}
Show(&tail);
Reverse_1(&tail);
Show(&tail);
return 0;
}
二:两个指针
时间复杂度O(n),空间复杂度O(1)
#include "list.h"
#include <assert.h>
#include <stdio.h>
void Reverse_2(List plist)
{
assert(plist != NULL);
if (plist == NULL || plist->next == NULL || plist->next->next == NULL)
{
return;