数据结构--线性表及其应用 约瑟夫环

#include "pch.h"
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
 
class node {
public:
	node * pnode = 0;
	int secret;
	int id = 1;
};

int main()
{
	int numberOfNode;								//用户输入的数据个数
	int m;											//初始的数字	
	int id = 1;										//节点标号
	cin >> m;
	cin >> numberOfNode;							//应该不会只有一个节点吧
	node * head = new node;
	node * prev = head;
	node *now = 0;
	cin >> head->secret;
	int numberOfNode1 = numberOfNode - 1;
	while (numberOfNode1--) {
		now = new node;
		cin >> now->secret;
		now->id = ++id;
		prev->pnode = now;
		prev = now;
	}
	now->pnode = head;
	//初始化循环链表

	node * p = head;
	while (numberOfNode != 0) {
		node * prev = p;
		int count = 1;
		while (count != m) {
			count++;
			prev = p;
			p = p->pnode;
		}
		//模拟数数
		prev->pnode = p->pnode; //去掉一个节点
		m = p->secret;
		
		cout << p->id << " ";
		if (prev == p) {        //如果只有两个节点 需要特殊处理
			p = p->pnode;
			numberOfNode--;
		}
		else {
			delete p;
			p = prev->pnode;
			numberOfNode--;
		}
	}
	return 0;
}