题目大概为有1-m个数,围成一圈,从第一个开始数,数到n的数退出,输出最后剩下的那个数。
如输入m n为6 4,则,输出顺序为4 2 1 3 6 5,所以最后输出为5。
其实这题想法很简单,就是用循环链表就解决了。
#include<iostream>
using namespace std;
struct node{
int data;
node *next;
};
void CreateList(node *&head, int m)
{
node *s, *p = nullptr;
int i = 0;
do{
s = new node;
s->data = i + 1;
s->next = nullptr;
if (i == 0){
head = s;
p = s;
}
else{
p->next = s;
p = p->next;
}
} while (++i < m);
p->next = head;
}
int main()
{
int m, n;
cin >> m >> n;
node *head;
CreateList(head, m);
node *p = head;
while (p != p->next){
for (int i = 0; i < n - 1; ++i)
p = p->next;
cout << p->data << endl;
p->data = p->next->data;
node *q = p->next;
p->next = p->next->next;
delete q;
}
cout << "最后一个为:"<<p->data << endl;
system("pause");
return 0;
}