用stl构建链表。很快就能解决

解题思路:

注意事项:

参考代码:

#include<bits/stdc++.h>

using namespace std;

list <int> node;

int main()

{

int n;cin >> n;

for(int i = 1;i <= n;i ++) node.push_back(i);

list <int> :: iterator it = node.begin(); 

while(n --)

{

for(int i = 1;i < 3;i ++)

{

it ++;

if(it == node.end()) it = node.begin();

}

list <int> :: iterator next = ++it;

if(next == node.end()) next = node.begin();

node.erase(--it);

it = next; 

}

cout << *it << endl;

return 0;

}