出队时Java队列程序结果为空

时间:2017-03-27 14:19:20

标签: java

这是我的代码:

import java.util.LinkedList;
import java.util.Scanner;
import java.util.InputMismatchException;
import java.util.*;





class Customer {
       public String lastName;
       public String firstName;
       public Customer() {
       }
       public Customer(String last, String first) {
          this.lastName = last;
          this.firstName = first;
       }
       public String toString() {
          return firstName + " " + lastName;
       }
    }
    class HourlyCustomer extends Customer {
       public double hourlyRate;
       public HourlyCustomer(String last, String first) {
          super(last, first);
       }
    }

class GenQueue<E> {
   private LinkedList<E> list = new LinkedList<E>();
   public void enqueue(E item) {
      list.addLast(item);
   }
   public E dequeue() {
      return list.poll();
   }
   public boolean hasItems() {
      return !list.isEmpty();
   }
   public boolean isEmpty()
   {
       return list.isEmpty();
   }
   public E removeFirst(){
       return list.removeFirst();
   }
   public E getFirst(){
       return list.getFirst();
   }
   public int size() {
      return list.size();
   }

   public void addItems(GenQueue<? extends E> q) {
      while (q.hasItems()) list.addLast(q.dequeue());
   }
}





public class something {

    public static void main(String[] args){



        Scanner sc = new Scanner(System.in);
        String input1;
        String input2;
        int choice = 1000;




        GenQueue<Customer> empList;
        empList = new GenQueue<Customer>();
        GenQueue<HourlyCustomer> hList;
        hList = new GenQueue<HourlyCustomer>(); 

        while(true){

        do{

            System.out.println("================");
            System.out.println("Queue Operations Menu");
            System.out.println("================");
            System.out.println("1,Enquene");
            System.out.println("2,Dequeue");
            System.out.println("0, Quit\n");
            System.out.println("Enter Choice:");
            try{

                choice = sc.nextInt();



                switch(choice){
                case 1:

                    do{


                    System.out.println("\nPlease enter last name:  ");
                    input1 = sc.next();
                    System.out.println("\nPlease enter first name:  ");
                    input2 = sc.next();
                    hList.enqueue(new HourlyCustomer(input1, input2));
                    empList.addItems(hList);

                    System.out.println("\n"+(input2 + " " +  input1) + " is successful queued");

                    System.out.println("\nDo you still want to enqueue?<1> or do you want to view all in queue?<0> or \nBack to main menu for dequeueing?<menu>: ");
                    choice = sc.nextInt();

                    }while (choice != 0);



                     System.out.println("\nThe customers' names are: \n");

                     while (empList.hasItems()) {
                     Customer emp = empList.dequeue();
                     System.out.println(emp.firstName + " " + emp.lastName + "\n" );
                     }

                     break;






                case 2:


                    if (empList.isEmpty()) {
                        System.out.println("The queue is empty!");
                    }
                    else
                    {
                    System.out.println("\nDequeued customer: "  +empList.getFirst());
                    empList.removeFirst();
                    }

                    if (empList.isEmpty()) {
                        System.out.println("The queue is empty!");
                    }
                    else
                    {
                    System.out.println("\nNext customer in queue: "  +empList.getFirst()+"\n");
                }

                    break;

                case 0:

                    System.exit(0);



                default:
                        System.out.println("Invalid choice");
                }

            }

            catch(InputMismatchException e){
                System.out.println("Please enter 1-5, 0 to quit");
                sc.nextLine();
            }

        }while(choice != 0);
        }
    }
}

我想创建一个接受队列的程序,然后也可以出列队列。在情况1我成功排队,但在案例2,我遇到了一些麻烦,我不知道我必须堆栈溢出它,我卡在这里,我可能只是错过了这段代码上的琐碎事情。所以我需要你的帮助。为什么在案例2中我的dequeue被传递一个空列表?我该如何解决?非常感谢你!

1 个答案:

答案 0 :(得分:0)

当你填充你的hlist时,你从empList中取出所有元素,因此你的empList最后都是空的。

while(q.hasItems())list.addLast(q.dequeue());

您可以重写addItems方法,只是迭代给定队列中的元素并将它们添加到自己的LinkedList中。