Q10.7

最新推荐文章于 2024-08-05 11:58:55 发布

seagullyoyo

最新推荐文章于 2024-08-05 11:58:55 发布

阅读量417

点赞数

分类专栏： Cracking the coding interview

本文链接：https://blog.csdn.net/seagullyoyo/article/details/38013181

版权

Cracking the coding interview 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

int findkth(int k)
{
	if (k == 1)
		return 0;
	if(k == 2)
		return 3;
	if(k == 3)
		return 5;
	if(k == 4)
		return 7;
	queue<int> a, b, c;
	a.push(3); a.push(5); a.push(7);
	b.push(3); b.push(5); b.push(7);
	c.push(3); c.push(5); c.push(7);
	
	int re, n = 4;
	while(n < k)
	{
		int t1 = a.front() * 3, t2 = b.front() * 5, t3 = c.front() * 7;
		
		if(t1 < t2)
		{
			if(t1 < t3)
			{
				a.pop();
				a.push(t1);
				re = t1;
			}
			else if(t1 == t3)
			{
				a.pop(); b.pop();
				a.push(t1);
				re = t1;
			}
			else
			{
				c.pop();
				c.push(t3);
				re = t3;
			}	
		}
		else if(t1 == t2)
		{
			a.pop(); b.pop();
			if(t1 == t3)
				c.pop();
			a.push(t1);
			re = t1;
		}
		else
		{
			if(t2 < t3)
			{
				b.pop();
				b.push(t2);
				re= t2;
			}
			else if(t2 == t3)
			{
				b.pop(); c.pop();
				b.push(t2);
				re = t2;
			}
			else
			{
				c.pop();
				c.push(t3);
				re = t3;
			}
		}
		n++;
	}
	if(n == k)
		return re;
}

int main(void)
{
	int k = 7;
	cout << findkth(k) << endl;
	
	return 0;
}