C++ 关于约瑟夫环的计算

最新推荐文章于 2021-05-24 15:49:17 发布

逃离那片云

最新推荐文章于 2021-05-24 15:49:17 发布

阅读量121

点赞数

分类专栏： C++ 文章标签：队列 C++ 约瑟夫环

本文链接：https://blog.csdn.net/qq_45824568/article/details/116193241

版权

C++ 专栏收录该内容

20 篇文章 1 订阅

订阅专栏

约瑟夫环

- 程序设计
- 运行结果

程序设计

#include "iostream"
using namespace std;

template <class T>
class Queue
{
public:
	Queue()
	{
		len = 0;
		size = 30;
		dp = new T[size];
		start = 0;
		end = -1;
	}
	void push(T dat);
	T pop();
	void travel();
	int getlength();
	void changearray();
	~Queue();
private:
	int len;//队列的长度
	T* dp;//队列的数组
	int size;//队列的最大容量
	int start;//头指针
	int end;//尾指针
};


template <class T>
void Queue<T>::push(T dat)
{
	if (len == size)
	{
		changearray();//一旦长度不够，调用扩容
	}
	end++;
	end = end % size;
	dp[end] = dat;
	len++;
}
template <class T>
void Queue<T>::changearray()//定义扩容函数
{
	T* tp = dp;
	size = size * 2;
	dp = new T[size];
	for (int i = 0; i < len; i++)
	{
		*(dp + i) = *(tp + i);
	}
}
template <class T>
T Queue<T>::pop()
{
	if (len == 0)
	{
		printf("队列已空\n");
		exit(1);
	}
	T temp = dp[start];
	start = (start + 1) % size;
	len--;
	return temp;
}

template <class T>
void Queue<T>::travel()
{
	int length = len;
	cout << "***********************" << endl;
	printf("size-%d\n", len);
	int t = start;
	while (length != 0)
	{
		printf("%d ", dp[t++]);
		t = t % size;
		length--;
	}
	cout << endl << "***********************" << endl;

}

template <class T>
int Queue<T>::getlength()
{
	return len;
}

template <class T>
Queue<T>::~Queue()
{
	delete[]dp;
}

int main()
{
	Queue<int>queue;
	for (int i = 0; i < 60; i++)//环的长度就在这里确定
	{
		queue.push(i + 1);
	}
	int count = 0;
	queue.travel();
	while (queue.getlength() != 1)
	{
		count++;
		int temp = queue.pop();
		if (count % 3 == 0)
		{
			cout << temp << " is killed!" << endl;
		}
		else
		{
			queue.push(temp);
		}
	}
	cout << queue.pop() << " is alive!" << endl;
	return 0;
}

运行结果

***********************
size-60
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
***********************
3 is killed!
6 is killed!
9 is killed!
12 is killed!
15 is killed!
18 is killed!
21 is killed!
24 is killed!
27 is killed!
30 is killed!
33 is killed!
36 is killed!
39 is killed!
42 is killed!
45 is killed!
48 is killed!
51 is killed!
54 is killed!
57 is killed!
60 is killed!
4 is killed!
8 is killed!
13 is killed!
17 is killed!
22 is killed!
26 is killed!
31 is killed!
35 is killed!
40 is killed!
44 is killed!
49 is killed!
53 is killed!
58 is killed!
2 is killed!
10 is killed!
16 is killed!
23 is killed!
29 is killed!
37 is killed!
43 is killed!
50 is killed!
56 is killed!
5 is killed!
14 is killed!
25 is killed!
34 is killed!
46 is killed!
55 is killed!
7 is killed!
20 is killed!
38 is killed!
52 is killed!
11 is killed!
32 is killed!
59 is killed!
28 is killed!
1 is killed!
47 is killed!
19 is killed!
41 is alive!