解题思路:
注意事项:
参考代码:
#include <iostream>
using namespace std;
struct person
{
int num;
person* next;
};
int main()
{
int n;
cin >> n;
person* head = new person;
head->num = 1;
head->next = NULL;
person* r = head;
person* p;
int count = 0;
for (int i = 2; i <= n; i++) //构造链表
{
p = new person;
p->num = i;
p->next = NULL;
r->next = p;
r = p;
}
r->next = head;
r = head;
for (int i = 1; i <= n - 1; i++)
{
for (int j = 1; j <= 1; j++) //找到第2个
{
r = r->next;
}
r->next = r->next->next; //删除节点
r = r->next;
}
cout << r->next->num;
return 0;
}
0.0分
1 人评分