n个人围一圈，喊1，2，3；为3的淘汰，找到最后一个人

n个人围一圈，喊1，2，3；为3的淘汰，找到最后一个人@链表

这个使用链表实现比较简单，直接上代码
#include

using namespace std;

struct ListNode {
int value;
struct ListNode* next;
ListNode(int x) :value(x), next(nullptr) {}
};

struct ListNode* CreateList(int n) {
struct ListNode* pHead = new ListNode(1);
int i = 1;
struct ListNode* pNode = pHead;
while (i < n) {
struct ListNode* tmp = new ListNode(i + 1);
pNode->next = tmp;
pNode = pNode->next;
i++;
}
pNode->next = pHead;
return pHead;
}

int FindNode(struct ListNode* pHead) {
struct ListNode* pNode = pHead;
int count = 1;
while (pNode->next != pNode) {
cout << "call value: " << pNode->value << endl;
if (count == 2) {
struct ListNode* tmp = pNode->next;
cout << "delete value: " << tmp->value << endl;
pNode->next = tmp->next;
delete tmp;
count = 1;
}
else {
count++;
}
pNode = pNode->next;
}
int left = pNode->value;
delete pNode;
return left;
}

int main(int argc, char** argv) {
int n = atoi(argv[1]);
struct ListNode* pHead = CreateList(n);
int left = FindNode(pHead);
cout << "left: " << left << endl;
return 0;
}

当输入5时，结果如下
call value: 1
call value: 2
delete value: 3
call value: 4
call value: 5
delete value: 1
call value: 2
call value: 4
delete value: 5
call value: 2
call value: 4
delete value: 2
left: 4