algoritmos/array/Queue_Dynamic.cs at master · sylviot/algoritmos · GitHub

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
using System;

public class ArrayMain
{
  public static void Main()
  {
    Queue queue = new Queue();

    queue.Enqueue(1);
    queue.Enqueue(2);
    queue.Enqueue(3);
    queue.Enqueue(4);
    queue.Enqueue(5);

    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());
  }
}

public class Queue
{
  int[] queue;

  public Queue()
  {
    /* Inicializando a fila vazia. */
    queue = new int[0];
  }

  /* Altere o tamanho da fila para adicionar o elemento */
  public void Enqueue(int element)
  {
    Array.Resize(ref queue, queue.Length + 1);
    queue[queue.Length - 1] = element;
  }

  /* Guarde o elemento e altere o tamanho da fila */
  public int Dequeue()
  {
    int element = queue[queue.Length - 1];
    Array.Resize(ref queue, queue.Length - 1);

    return element;
  }
}