algoritmos/array/Queue_Static.cpp 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
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>

using namespace std;

class Queue {

  int *queue, max, current;
  public:
    Queue(int max)
    {
      this->queue = new int[max];

      this->max = max;
      this->current = -1;
    }

    void enqueue(int element){
      if( this->current + 1 == this->max ) return;

      this->queue[++this->current] = element;
    }

    int dequeue(){
      if( this->current == -1 ) throw "Empty";

      int element = this->queue[0];
      for(int i = 0; i < this->current; i++){
        queue[i] = queue[i+1];
      }

      this->queue[current--] = 0;

      return element;
    }
};

int main()
{
  Queue queue(5);
  queue.enqueue(1);
  queue.enqueue(2);
  queue.enqueue(3);
  queue.enqueue(4);
  queue.enqueue(5);

  printf("Dequeue > %d\n", queue.dequeue());
  printf("Dequeue > %d\n", queue.dequeue());
  printf("Dequeue > %d\n", queue.dequeue());
  printf("Dequeue > %d\n", queue.dequeue());
  printf("Dequeue > %d\n", queue.dequeue());

  /* Gera Exception por não ter mais elementos na fila */
  //printf("Dequeue > %d\n", queue.dequeue());

  return 0;
}