下列C++代码 循环链表解决约瑟夫问题，即假设 n 个 围成 圈，从第 个 开始数，每次数到第 k 个 用 人 一 一 人 的 就出圈，输出最后留下的那个 的编号。横线上应填写（ ）。 人 人
struct Node {
int data;
Node* next;
};
Node* createCircularList(int n) {
Node* head = new Node{1, nullptr};
Node* prev = head;
for (int i = 2; i <= n; ++i) {
Node* node = new Node{i, nullptr};
prev->next = node;
prev = node;
}
prev->next = head;
return head;
}
int fingLastSurvival(int n, int k) {
Node* head = createCircularList(n);
Node* p = head;
Node* prev = nullptr;
while (p->next != p) {
for (int count = 1; count < k; ++count) {
prev = p;
p = p->next;
}
_______________________
}
cout << "最后留下的人编号是: " << p->data << endl;
delete p;
return 0;
}
- A. 1 prev->next = p->next; 2 delete p; 3 p = prev->next;
- B. 1 delete p; 2 prev->next = p->next; 3 p = prev->next;
- C. 1 delete p; 2 p = prev->next; 3 prev->next = p->next;
- D. 1 prev->next = p->next; 2 p = prev->next; 3 delete p;
正确答案：A