Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Queue {
- private int[] list;
- private int i=0;
- public Queue(){
- Init();
- }
- public void Init(){
- list=new int[10];
- }
- public int FindLast(){
- int a=-1;
- for(int i=9;i>=0;i--)
- if (list[i]!=0) {
- a=i;
- break;
- }
- return a;
- }
- public void Enqueue(int x){
- if(i+1<10){
- for(int a=8;a>=0;a--) list[a+1]=list[a];
- list[0]=x;
- i++;
- }
- else
- System.out.println("Schlange voll.");
- }
- public void Dequeue(){
- if(!Empty())
- list[FindLast()]=0;
- else
- System.out.println("Schlange leer.");
- }
- public int Front(){
- if(!Empty())
- return list[0];
- else{
- System.out.println("Schlange leer.");
- return -1;
- }
- }
- public Boolean Empty(){
- if(i==0)
- return true;
- else
- return false;
- }
- public void Show(){
- System.out.println("");
- if(!Empty())
- for(int a=0;a<10;a++)
- if(a<9)System.out.print(list[a]+",");
- else System.out.print(list[a]);
- else
- System.out.println("Schlange leer.");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement