DS双向链表—祖玛 C++

#include <iostream>
using namespace std;
class Node {
	public:
		char data;
		Node * next = NULL;
};
class List {//带头结点的单链表，位置从0到n，0是头结点，1是首结点，n是尾结点
	public:
		Node * head; //头结点
		int size; //表长
		List();		//构造函数，创建头结点
		~List();	//析构函数，逐个结点回收
		int Insert(char item, int i);	//第i位置插入元素，操作成功或失败返回OK或ERROR
		void print();//打印单链表所有数据
		int get(int i) {
			Node*p = head->next;
			int j = 1;
			while (j++ < i) {
				p = p->next;
			}
			return p->data;
		}
		int del(int i) {
			Node*p = head, *q = head->next;
			int j = 1;
			while (j++ < i) {
				p = p->next;
				q = q->next;
			}
			p->next = q->next;
			delete q;
			size--;
			return 0;
		}
		int same(int i) {
			int count = 1;
			Node*p = head->next;
			int j = 1;
			while (j++ < i) {
				p = p->next;
			}
			while (p && p->next) {
				if (p->data == p->next->data) {
					count++;
					p = p->next;
				} else break;
			}
			return count;
		}
};
List::List(): size(0) {
	head = new Node();
}
List::~List() {
	Node *p, *q;
	p = head->next;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	size = 0;
	head->next = NULL;
}
int List::Insert(char item, int i) {
	Node*p = head;
	int j = 0;
	while (j++ < i) {
		p = p->next;
	}
	Node*q = new Node();
	q->data = item;
	q->next = p->next;
	p->next = q;
	size++;
	return 0;
}
void List::print() {
	Node*p = head->next;
	if (p)
		for (int i = 1; i <= size; i++) {
			cout << p->data;
			p = p->next;
		} else cout << '-';
	cout << endl;
}
void Yezi(List&zuma) {
	int flag = 1;
	while (flag) {
		flag = 0;
		for (int i = 1; i < zuma.size - 1; i++) {
			int count = zuma.same(i);
			if (count > 2) {
				flag = 1;
				while (count--)
					zuma.del(i);
			}
		}
	}
}
int main() {
	string temp;
	cin >> temp;
	List zuma;
	for (int i = 0; temp[i]; i++)
		zuma.Insert(temp[i], i);
	int n, pos;
	char bead;
	cin >> n;
	while (n--) {
		cin >> pos >> bead;
		zuma.Insert(bead, pos);
		Yezi(zuma);
		zuma.print();
	}
}