forked from sylviot/algoritmos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue_Static.cs
66 lines (56 loc) · 1.33 KB
/
Queue_Static.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
using System;
public class ArrayMain
{
public static void Main()
{
Queue queue = new Queue(5);
queue.Enqueue(1);
queue.Enqueue(2);
queue.Enqueue(3);
queue.Enqueue(4);
queue.Enqueue(5);
queue.Enqueue(6);
Console.WriteLine("Dequeue > {0}", queue.Dequeue());
Console.WriteLine("Dequeue > {0}", queue.Dequeue());
Console.WriteLine("Dequeue > {0}", queue.Dequeue());
Console.WriteLine("Dequeue > {0}", queue.Dequeue());
Console.WriteLine("Dequeue > {0}", queue.Dequeue());
// Gera Exception por não ter mais elementos na fila.
//Console.WriteLine("Dequeue > {0}", queue.Dequeue());
}
}
public class Queue
{
int length, current;
int[] queue;
/*
Método contrutor da fila recebe o tamanho
*/
public Queue(int length)
{
// Inicia a fila com o tamanho determinado
queue = new int[length];
this.length = length;
current = -1;
}
/*
Verifica se a fila não está cheia e adiciona o elemento.
*/
public void Enqueue(int element)
{
if(current + 1 == length) return;
queue[++current] = element;
}
/*
Verifica se ainda tem elementos para retirar da fila
e limpa a posição do elemento retirado.
*/
public int Dequeue()
{
if(current == -1) throw new Exception("Empty");
int element = queue[0];
for(int i = 0; i < current;i++) queue[i] = queue[i+1];
queue[current--] = 0;
return element;
}
}