cpp
#include <iostream>
//实现单链表
class Node {
public:
int data;
Node* next;
Node(int value) :data(value), next(nullptr) {}
};
class LinkedList
{
private:
Node* head;
public:
LinkedList() :head(nullptr) {}
//添加元素在最后
void appent(int value) {
Node* new_node = new Node(value);
if (!head) {
head = new_node;
return;
}
Node* current = head;
while (current->next)
{
current = current->next;
}
current->next = new_node;
}
//显示函数
void display() {
Node* current = head;
while (current)
{
std::cout << current->data << "->";
current = current->next;
}
std::cout << "nullptr" << std::endl;
}
//删除一个特定节点
void remove(int value) {
if (!head) {
return;
}
if (head->data == value) {
Node* temp = head;
head = head->next;
delete temp;
}
Node* current = head;
while (current->next)
{
if (current->data == value) {
Node* temp = current->next;
current->next = current->next->next;
delete temp;
return;
}
current = current->next;
}
}
//查找
bool search(int value) {
Node* current = head;
while (current) {
if (current->data == value) {
return true;
}
current = current->next;
}
return false;
}
//清除
void clear() {
while (head) {
Node* temp = head;
head = head->next;
delete temp;
}
}
~LinkedList() {
clear();
}
};
int main()
{
LinkedList Mylist;
Mylist.appent(1);
Mylist.appent(2);
Mylist.appent(3);
Mylist.appent(4);
Mylist.display();
Mylist.remove(1);
Mylist.display();
}