单向循环代码实现cpp

// 单向循环链表
class CircleLink
{
public:CircleLink(){head_ = new Node();tail_ = head_;head_->next_ = head_;}~CircleLink(){Node* p = head_->next_;while (p != head_){head_->next_ = p->next_;delete p;p = head_->next_;}delete head_;}public:// 尾插法   O(1)void InsertTail(int val){Node* node = new Node(val);node->next_ = tail_->next_; // node->next_ = head_;tail_->next_ = node;tail_ = node; // 更新tail_指针指向新的尾节点}// 头插法void InsertHead(int val){Node* node = new Node(val);node->next_ = head_->next_;head_->next_ = node;if (node->next_ == head_){tail_ = node;}}// 删除节点void Remove(int val){Node* q = head_;Node* p = head_->next_;while (p != head_){if (p->data_ == val){// 找到删除节点   head //                 q     q->next_ = p->next_;delete p;if (q->next_ == head_){tail_ = q;}return;}else{q = p;p = p->next_;}}}// 查询bool Find(int val) const{Node* p = head_->next_;while (p != head_){if (p->data_ == val){return true;}}return false;}// 打印链表void Show() const{Node* p = head_->next_;while (p != head_){cout << p->data_ << " ";p = p->next_;}cout << endl;}private:struct Node{Node(int data = 0) : data_(data), next_(nullptr) {}int data_;Node* next_;};Node* head_; // 指向头节点Node* tail_; // 指向末尾节点
};int main()
{CircleLink clink;srand(time(NULL));clink.InsertHead(100);for (int i = 0; i < 10; i++){clink.InsertTail(rand() % 100);}clink.InsertTail(200);clink.Show();clink.Remove(200);clink.Show();clink.InsertTail(300);clink. Show();
}