C++ 数组模拟指针实现链表：插入和查询操作

There is an error in the given code. The issue is with the implementation of the insert operation. The current implementation does not correctly update the "next" pointers of the nodes. Here is the corrected code:\n\ncpp\n#include<bits\/stdc++.h>\nusing namespace std;\n\nstruct ListNode {\n int value;\n int next;\n};\n\nint main() {\n int n, q;\n cin >> n >> q;\n ListNode nodes[n+1];\n for (int i = 1; i <= n; i++) {\n cin >> nodes[i].value;\n nodes[i].next = i + 1;\n }\n nodes[n].next = 0;\n int head = 1;\n for (int i = 0; i <q; i++) {\n int op;\n cin >> op;\n if (op == 1) {\n int k, val;\n cin >> k >> val;\n int newNodeIndex = nodes[0].next;\n nodes[0].next = nodes[newNodeIndex].next;\n nodes[newNodeIndex].value = val;\n nodes[newNodeIndex].next = nodes[k].next;\n nodes[k].next = newNodeIndex;\n } else if (op == 2) {\n int k;\n cin >> k;\n int cur = head;\n for (int j = 1; j < k; j++) cur = nodes[cur].next;\n cout << nodes[cur].value << '\n';\n }\n }\n return 0;\n}\n\n\nThis code correctly implements the insert operation by updating the "next" pointers of the nodes.