大佬求调

#include <bits/stdc++.h>
using namespace std;
struct node {
	int data;
	node *next;
	node() : data(0), next(nullptr) {}
	node(int val) : data(val), next(nullptr) {}
};
node *lastFound = nullptr;
node *getNode(node *head, int pos) {
	if (pos == 0 || head == nullptr) {
		return nullptr;
	}
	if (lastFound != nullptr && lastFound->data == pos) {
		return lastFound;
	}
	node *curr = head;
	while (curr != nullptr && curr->data != pos) {
		curr = curr->next;
	}
	lastFound = curr;
	return curr;
}
void insert(node *head, int pos, int data) {
	node *newNode = new node(data);
	node *curr = getNode(head, pos);
	if (curr == nullptr) {
		return;
	}
	newNode->next = curr->next;
	curr->next = newNode;
}
void remove(node *head, int data) {
	node *curr = getNode(head, data);
	if (curr == nullptr || curr->next == nullptr) {
		return;
	}
	node *temp = curr->next;
	curr->next = temp->next;
	delete temp;
	temp = nullptr;
}
void print(node *head) {
	node *curr = head;
	while (curr != nullptr) {
		cout << curr->data << " ";
		curr = curr->next;
	}
	cout << "\n";
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	cin.rdbuf()->pubsetbuf(nullptr, 0);
	cout.rdbuf()->pubsetbuf(nullptr, 0);
	
	int n;
	cin >> n;
	node *head = new node(1);
	lastFound = head;
	//head->next = new node(2); head->next->next = new node(3);
	while (n--) {
		int id;
		cin >> id;
		if (id == 1) {
			int x, y;
			cin >> x >> y;
			insert(head, x, y);
		} else if (id == 2) {
			int x;
			cin >> x;
			node *curr = getNode(head, x);
			if (curr == nullptr || curr->next == nullptr) {
				cout << "0\n";
				continue;
			}
			cout << curr->next->data << "\n";
		} else if (id == 3) {
			int x;
			cin >> x;
			remove(head, x);
		}
	}
	//print(head);
	return 0;
}