链表问题，可自己搭建链表也可直接用stl

解题思路:

注意事项:

参考代码:

#include<bits/stdc++.h>

using namespace std;

int main()

{

int n;cin >> n;

list<int>node;

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;

return 0;

}