1栈和队列--猫狗队列

最新推荐文章于 2020-06-20 08:26:21 发布

朵朵_calm

最新推荐文章于 2020-06-20 08:26:21 发布

阅读量544

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构题目最优解文章标签：栈

本文链接：https://blog.youkuaiyun.com/m_future1993/article/details/53893917

算法与数据结构题目最优解专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个宠物队列管理系统的设计与实现，该系统采用Java编程语言，通过定义宠物、猫、狗等类，并利用队列数据结构来管理宠物的进出顺序。系统支持不同类型的宠物加入队列，并能按照先进先出的原则处理猫狗队列。

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

这里写图片描述

//宠物、猫、狗的类
    public static class Pet {
        private String type;
        public Pet(String type) {
            this.type = type;
        }
        public String getPetType() {
            return this.type;
        }
    }
    public static class Dog extends Pet {
        public Dog() {
            super("dog");
        }
    }
    public static class Cat extends Pet {
        public Cat() {
            super("cat");
        }
    }
//定义一个新的类
    public static class PetEnterQueue {
        private Pet pet;
        private long count;
        public PetEnterQueue(Pet pet, long count) {
            this.pet = pet;
            this.count = count;
        }
        public Pet getPet() {
            return this.pet;
        }
        public long getCount() {
            return this.count;
        }
        public String getEnterPetType() {
            return this.pet.getPetType();
        }
    }
//定义猫狗队列
    public static class DogCatQueue {
        private Queue<PetEnterQueue> dogQ;
        private Queue<PetEnterQueue> catQ;
        private long count;
        public DogCatQueue() {
            this.dogQ = new LinkedList<PetEnterQueue>();
            this.catQ = new LinkedList<PetEnterQueue>();
            this.count = 0;
        }
//添加动物
        public void add(Pet pet) {
            if (pet.getPetType().equals("dog")) {
                this.dogQ.add(new PetEnterQueue(pet, this.count++));
            } else if (pet.getPetType().equals("cat")) {
                this.catQ.add(new PetEnterQueue(pet, this.count++));
            } else {
                throw new RuntimeException("err, not dog or cat");
            }
        }

        public Pet pollAll() {
            if (!this.dogQ.isEmpty() && !this.catQ.isEmpty()) {
                if (this.dogQ.peek().getCount() < this.catQ.peek().getCount()) {
                    return this.dogQ.poll().getPet();
                } else {
                    return this.catQ.poll().getPet();
                }
            } else if (!this.dogQ.isEmpty()) {
                return this.dogQ.poll().getPet();
            } else if (!this.catQ.isEmpty()) {
                return this.catQ.poll().getPet();
            } else {
                throw new RuntimeException("err, queue is empty!");
            }
        }

        public Dog pollDog() {
            if (!this.isDogQueueEmpty()) {
                return (Dog) this.dogQ.poll().getPet();
            } else {
                throw new RuntimeException("Dog queue is empty!");
            }
        }

        public Cat pollCat() {
            if (!this.isCatQueueEmpty()) {
                return (Cat) this.catQ.poll().getPet();
            } else
                throw new RuntimeException("Cat queue is empty!");
        }

        public boolean isEmpty() {
            return this.dogQ.isEmpty() && this.catQ.isEmpty();
        }

        public boolean isDogQueueEmpty() {
            return this.dogQ.isEmpty();
        }

        public boolean isCatQueueEmpty() {
            return this.catQ.isEmpty();
        }

    }