1_4猫狗队列

最新推荐文章于 2020-01-26 22:24:11 发布

RaymondLove~

最新推荐文章于 2020-01-26 22:24:11 发布

阅读量349

点赞数

分类专栏：《程序员代码面试指南》学习笔记

本文链接：https://blog.csdn.net/Emma_Love/article/details/53884801

版权

《程序员代码面试指南》学习笔记专栏收录该内容

11 篇文章 0 订阅

订阅专栏

1. 题目：《程序员代码面试指南》第10页

2. 思路和想法：太厉害了！书中把可能想到的错误解法都给列了出来，并且我在思考的时候果断命中两个错误想法（）。不能改写原来的类，那么只能去封装自己的类，对原来的类进行修饰，用到时间戳标记每个对象的先后顺序，利用两个队列分别存储dog和cat。思考的一定要周到全面！！！！Fighting

3. Answer:

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

class Pet
{
public:
	Pet(string type)
	{
		this->type = type;
	}
	string getType()
	{
		return this->type;
	}
private:
	string type;
};


class Cat:public Pet
{
public:
	Cat():Pet("cat")
	{
	}
};

class Dog :public Pet
{
public:
	Dog() :Pet("dog")
	{
	}
};

class PetEnterQueue
{
public:
	PetEnterQueue(Pet *t,int count)
	{
		this->t = t;
		this->count = count;
	}
	string getEnterPetType()
	{
		return this->t->getType();
	}
	int getCount()
	{
		return count;
	}
	Pet * getPet()
	{
		return t;
	}
private:
	Pet* t;
	int count;
};

class DogCatQueue
{
public:
	DogCatQueue()
	{
		this->count = 0;
	}
	void add(Pet *pet)
	{
		if (pet->getType()=="dog")
		{
			dogQ.push(new PetEnterQueue(pet,this->count++));
		}
		else if (pet->getType() == "cat")
		{
			catQ.push(new PetEnterQueue(pet, this->count++));
		}
		else
		{
			throw new exception("not dog or cat\n");
		}
	}
	Pet * pollAll()
	{
		if (this->dogQ.empty()&&this->catQ.empty())
		{
			throw new exception("queue is empty");
		}
		else if (!this->dogQ.empty() && !this->catQ.empty())
		{
			if (this->dogQ.front()->getCount()<this->catQ.front()->getCount())
			{
				PetEnterQueue *t = this->dogQ.front();
				this->dogQ.pop();
				return t->getPet();
			}
			else
			{
				PetEnterQueue *t = this->catQ.front();
				this->catQ.pop();
				return t->getPet();
			}
		}
		else if (!this->dogQ.empty())
		{
			PetEnterQueue *t = this->dogQ.front();
			this->dogQ.pop();
			return t->getPet();
		}
		else
		{
			PetEnterQueue *t = this->catQ.front();
			this->catQ.pop();
			return t->getPet();
		}
	}
	Pet * pollDog()
	{
		if (!this->dogQ.empty())
		{
			PetEnterQueue *t = this->dogQ.front();
			this->dogQ.pop();
			return t->getPet();
		}
		else{
			throw new exception("dog queue is empty");
		}
	}
	Pet * pollCat()
	{
		if (!this->catQ.empty())
		{
			PetEnterQueue *t = this->catQ.front();
			this->catQ.pop();
			return t->getPet();
		}
		else{
			throw new exception("cat queue is empty");
		}
	}

	bool isEmpty()
	{
		return this->dogQ.empty() && this->catQ.empty();
	}
	bool isDogQueueEmpty()
	{
		return this->dogQ.empty();
	}
	bool isCatQueueEmpty()
	{
		return this->catQ.empty();
	}
private:
	queue<PetEnterQueue *> dogQ;
	queue<PetEnterQueue *> catQ;
	int count;
};
int main()
{
	DogCatQueue q;

	Cat c1, c2, c3, c4;
	Dog d1, d2, d3;
	
	q.add(&c1);
	q.add(&d1);
	q.add(&d1);
	q.add(&c2);
	q.add(&c3);
	q.add(&d3);
	q.add(&c4);
	
	Pet *t = NULL;

	t = q.pollAll();
	cout << t->getType().c_str() << endl;
	t = q.pollDog();
	cout << t->getType().c_str() << endl;
	t = q.pollCat();
	cout << t->getType().c_str() << endl;

	system("pause");
	return 1;
}