zoukankan      html  css  js  c++  java
  • 《程序员代码面试指南》第一章 栈和队列 猫狗队列

    题目

    通过给定的类实现猫狗队列
    

    程序

    /**
     * @Description:猫狗队列
     * @Author: lizhouwei
     * @CreateDate: 2018/4/5 14:34
     * @Modify by:
     * @ModifyDate:
    */
    public class Chapter1_4 {
        private static final String DOG ="dog";
        private static final String CAT ="cat";
    
        private Queue<PetQueue> dogQueue ; //存放狗的队列
        private Queue<PetQueue> catQueue; //存放猫的队列
        private long count;//标记存放先后顺序的
        public Chapter1_4(){
            this.dogQueue = new LinkedList<PetQueue>();//初始化
            this.catQueue = new LinkedList<PetQueue>();//初始化
            this.count = 0;//初始化
        }
        public void add(Pet pet){
            if(DOG.equalsIgnoreCase(pet.getType())){
                 dogQueue.offer(new PetQueue(pet,this.count++));
            }else{
                catQueue.offer(new PetQueue(pet,this.count++));
            }
        }
    
        //取出队列中最早进入队列的宠物
        public Pet pollAll(){
           //如果 两个队列中都有值
            if(!dogQueue.isEmpty() && !catQueue.isEmpty()){
                //如果dog的存放的编号小于cat的编号,则 说明dog比cat存放的早
                if(dogQueue.peek().getNumber()<catQueue.peek().getNumber()){
                    return dogQueue.poll().getPet();
                }else{
                    return catQueue.poll().getPet();
                }
            }else if(!dogQueue.isEmpty()) {
                //如果dog队列中有值而 cat队列已为空
                return dogQueue.poll().getPet();
            }else if(!catQueue.isEmpty()){
                //如果cat队列中有值而 dog队列已为空
                return catQueue.poll().getPet();
            }else{
                //都为空
                return null;
            }
        }
        //判断对列中是否都为空
        public boolean isEmpty(){
            return dogQueue.isEmpty() && catQueue.isEmpty();
        }
        //判断dog队列中是否都为空
        public boolean dogIsEmpty(){
            return dogQueue.isEmpty();
        }
        //判断cat队列中是否都为空
        public boolean catIsEmpty(){
            return catQueue.isEmpty();
        }
    
        //测试
        public static  void  main(String[] args){
            Chapter1_4 chapter = new Chapter1_4();
            for(int i=0;i<10;i++) {
                if((i&1)!=0){
                    chapter.add(new Pet(DOG));
                }else{
                    chapter.add(new Pet(CAT));
                }
             }
            System.out.println(chapter.isEmpty());
            System.out.println(chapter.dogIsEmpty());
            System.out.println(chapter.catIsEmpty());
            while(!chapter.isEmpty()){
                System.out.print(chapter.pollAll().getType() +" ");
            }
        }
    }
    // 创建一个pet的队列类
    class PetQueue{
        private Pet pet;//存放的宠物
        private long number; //存放的编号
        public PetQueue(Pet pet, long number) {
            this.pet = pet;
            this.number = number;
        }
        //获取编号
        public long getNumber(){
            return this.number;
        }
        //获取宠物
        public Pet getPet(){
            return this.pet;
        }
    }
    //题目给的,不能随意修改的
     class Pet{
        private String type;
         public Pet(){
          }
        public Pet(String type){
            this.type = type;
        }
        public String getType(){
            return this.type;
        }
    }
    //题目给的,不能随意修改的
    class Dog extends  Pet{
     public Dog(){
         super("dog");
     }
    }
    //题目给的,不能随意修改的
    class Cat extends  Pet{
        public Cat(){
            super("cat");
        }
    }
    
  • 相关阅读:
    openpose_caffe_to_rknn.py
    ncnn的完整编译过程
    We Need More Bosses CodeForces
    Yet Another Problem On a Subsequence CodeForces
    牛客 82E 无向图中的最短距离 (bitset,bfs)
    Largest Submatrix 3 CodeForces
    bzoj 4245 [ONTAK2015]OR-XOR (贪心)
    BZOJ 2836 魔法树 链剖裸题~~
    BZOJ 3083 遥远的国度 树链剖分+脑子
    Luogu P1471 方差 线段树
  • 原文地址:https://www.cnblogs.com/lizhouwei/p/8722945.html
Copyright © 2011-2022 走看看