假设要删除的节点为tobedeteleted
思路:
-
按顺序遍历至tobedeteleted的前一个节点,然后使它指向tobedeteleted的next,再将tobedeteleted的空间释放;(此方法的时间复杂度为O(n),不符合题意)
-
考虑tobedeteleted的位置:
(1). tobedeteleted的next不为空:
用其next上的值覆盖tobedeteleted上的值,然后删除next节点;
(2). tobedeteleted的next为空(即待删节点为链尾节点):
a. 链表中只有一个节点
删除 tobedeteleted,将链表置空;
b. 链表中节点数大于1
按顺序遍历至tobedeteleted的前一个节点,然后使它指向空,再将tobedeteleted的空间释放;代码:
#include<stdio.h>
#include<stdlib.h>
typedef struct Linknode
{
int val;
struct Linknode* next;
}Linknode;
//创建节点
Linknode* create_link(int val)
{
Linknode* head = (Linknode*)malloc(sizeof(Linknode));
head->val = val;
head->next = NULL;
return head;
}
//连接节点
void connection_linknode(Linknode* node1, Linknode* node2)
{
node1->next = node2;
}
//输出单链表
void print_link(Linknode* head)
{
while (head)
{
printf("%d ", head->val);
head = head->next;
}
printf("\n");
}
void DeleteNode(Linknode** head, Linknode* tobedeleted)
{
if ((head == NULL) || (tobedeleted == NULL))
return;
//待删除节点不是尾节点
if (tobedeleted->next != NULL)
{
Linknode* next = tobedeleted->next;
tobedeleted->val = next->val;
tobedeleted->next = next->next;
free(next);
next = NULL;
return;
}
//待删除节点是尾节点
//待删除节点是尾节点---也是头节点
if (*head == tobedeleted)
{
free(tobedeleted);
tobedeleted = NULL;
*head = NULL;
}
else
{
//待删除节点是尾节点---不是头节点
Linknode* node = head;
while (node->next != tobedeleted)
node = node->next;
node->next = NULL;
free(tobedeleted);
tobedeleted = NULL;
}
}
int main(void)
{
//创建单链表
Linknode* head1 = create_link(1);
Linknode* head2 = create_link(2);
Linknode* head3 = create_link(3);
Linknode* head4 = create_link(4);
Linknode* head5 = create_link(5);
printf("节点创建成功!\n");
connection_linknode(head1, head2);
connection_linknode(head2, head3);
connection_linknode(head3, head4);
connection_linknode(head4, head5);
printf("单链表创建成功!\n");
//输出该单链表
print_link(head1);
//删除tobedeleted节点
DeleteNode(head1, head3);
printf("删除成功!!\n");
//输出该单链表
print_link(head1);
return 0;
}
运行结果:
注意:待删除节点不是尾节点时,在释放完next后,要return,否则会继续执行,删除掉tobedeteleted之后的所有节点。
我们把DeleteNode函数中的return注释掉:
不加return的运行结果:
接下来我们测试删除空节点和尾节点,将main函数修改为:
int main(void)
{
//创建单链表
Linknode* head1 = create_link(1);
Linknode* head2 = create_link(2);
Linknode* head3 = create_link(3);
Linknode* head4 = create_link(4);
Linknode* head5 = create_link(5);
printf("节点创建成功!\n");
connection_linknode(head1, head2);
connection_linknode(head2, head3);
connection_linknode(head3, head4);
connection_linknode(head4, head5);
printf("单链表创建成功!\n");
//输出该单链表
printf("初始单链表:\n");
print_link(head1);
//删除tobedeleted节点
DeleteNode(head1, NULL);
printf("删除空节点后的单链表:\n");
print_link(head1);
DeleteNode(head1, head3);
printf("删除第三个节点后的单链表:\n");
print_link(head1);
DeleteNode(head1, head5);
printf("删除尾节点后的单链表:\n");
print_link(head1);
printf("删除成功!!\n");
//输出该单链表
return 0;
}
运行结果为:
OK!!!