《CTCI》3.7 “猫狗”队列

本文介绍了一个动物收容所的数据结构设计方案,该收容所仅收容猫和狗,并采用严格的“先来先服务”原则。文章详细阐述了如何实现enqueue、dequeueAny、dequeueDog和dequeueCat等操作。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

《CITI》P145

3 栈与队列

题目:

3.7 An animal shelter holds only dogs and cats, and operates on a strictly “first in, first out” basis. People must adopt either the “oldest” (based on arrival time) of all animals at the shelter, or they can select whether they would prefer a dog or a cat (and will receive the oldest animal of that type). They cannot select which specific animal they would like. Create the data structures to maintain this system and implement operations such as enqueue, dequeueAny, dequeueDog and dequeueCat. You may use the built-in LinkedList data structure.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值