algoritmos/array/Queue_Dynamic.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
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>

using namespace std;

class Queue{

  int *queue, max;

  public:
    Queue(){
      this->queue = new int[0];
      this->max = 0;
    }

    void enqueue(int element) {
      int *temp = new int[this->max];

      memcpy(temp, this->queue, this->max * sizeof(int));

      this->queue = new int[this->max + 1];
      for(int i = 0; i < this->max; i++) {
        this->queue[i] = temp[i];
      }

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

    int dequeue(){
      int element = this->queue[0];

      int *temp = new int[this->max];
      memcpy(temp, this->queue, this->max * sizeof(int));

      this->queue = new int[this->max - 1];

      for(int i = 1; i < this->max; i++) {
        this->queue[i-1] = temp[i];
      }

      return element;
    }
};

int main()
{
  Queue queue;
  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;
}