链表123

单链表

 #include<iostream>
 using namespace std;
 struct Node {
     int val;
     Node* next;
     Node(int val, Node* next) :val(val), next(next) {};
 };
 Node* head = new Node(-1, nullptr);
 ​
 //1插入
 void insert(int index,int val) {
     int i = -1;
     Node* p;
     for (p = head; p != nullptr; p = p->next, i++) {
         if (i == index - 1) break;
     }
     if (p == nullptr) return;
 ​
     p->next = new Node(val, p->next);
 }
 ​
 //2删除
 void remove(int index) {
     int i = -1;
     Node *p;
     for (p = head; p != nullptr; p = p->next, i++) {
         if (i == index - 1) break;
     }
     if (p == nullptr) return;
     p->next = p->next->next;
 }
 ​
 //3遍历
 ​
 void loop() {
     Node *p=head->next;
     while (p != nullptr) {
         cout << p->val << endl;
         p = p->next;
     }
 }
 ​
 //4查找节点
 ​
 Node* find(int index) {
     int i = -1;
     Node* p;
     for (p = head; p != nullptr; p = p->next, i++) {
         if (i == index) return p;
     }
     return nullptr;
 }
 ​
 int main() {
     insert(0, 1);
     insert(1, 2);
     insert(2, 3);
     loop();
     remove(2);
     loop();
     Node*p=find(0);
     cout << p->val;
 ​
 }

双链表

 #include<iostream>
 using namespace std;
 ​
 struct Node {
     Node* prev;
     int val;
     Node* next;
     Node(Node* prev, int val, Node* next) :prev(prev), val(val), next(next) {}
 };
 ​
 Node* head = new Node(nullptr, -1, nullptr);
 Node* tail = new Node(nullptr, -1, nullptr);
 ​
 //1查找
 Node* find(int index) {
     int i = -1;
     Node *p;
     for (p = head; p != tail; p = p->next, i++) {
         if (i == index) return p;
     }
     return nullptr;
 }
 ​
 //2遍历
 void loop() {
     Node* p = head->next;
     while (p != tail) {
         cout << p->val << endl;
         p = p->next;
     }
 }
 ​
 //3添加
 void insert(int index, int val) {
     Node* pre = find(index - 1);
         if (pre == nullptr) return;
     Node* next = pre->next;
     Node* mid = new Node(pre, val, next);
     pre->next = mid;
     next->prev = mid;
 }
 ​
 //4删除
 void remove(int index) {
     Node* pre = find(index - 1);
         if (pre == nullptr) return;
     Node* removed = find(index);
         if (removed == nullptr) return;
     Node* next = find(index + 1);
     pre->next = next;
     next->prev = pre;
 }
 ​
 //5特：加尾
 void addLast(int val) {
     Node* last = tail->prev;
     Node* mid = new Node(last, val, tail);
     last->next = mid;
     tail->prev = mid;
 }
 //6特：删尾
 void removeLast() {
     Node* removed = tail->prev;
         if (removed == head) return;
     Node* pre = removed->prev;
     pre->next = tail;
     tail->prev = pre;
 }
 ​
 int main() {
     head->next = tail;
     tail->prev = head;
     insert(0, 1);
     insert(1, 2);
     insert(2, 3);
     insert(3, 4);
     //loop();
     remove(0);
     //loop();
     addLast(5);
     //loop();
     removeLast();
     loop();
 }

双向环形链表

 #include<iostream>
 using namespace std;
 struct Node {
     Node* prev;
     int val;
     Node* next;
     Node(Node* prev, int val, Node* next) :prev(prev), val(val), next(next) {};
 };
 Node* head = new Node(nullptr, -1, nullptr);
 ​
 ​
 //2遍历
 void loop() {
     Node* p = head->next;
     while (p != head) {
         cout << p->val;
         p = p->next;
     }
 }
 ​
 ​
 int main() {
     head->prev = head;
     head->next = head;
 }