|
2 | 2 | #define MAX 10 |
3 | 3 |
|
4 | 4 | typedef struct { |
5 | | -int container[MAX]; |
6 | | -int front; |
7 | | -int rear; |
| 5 | +int container[MAX]; |
| 6 | +int front; |
| 7 | +int rear; |
8 | 8 | } queue; |
9 | 9 |
|
10 | 10 | queue getNewQueue() { |
11 | | -queue newQ; |
12 | | -newQ.front = -1; |
13 | | -newQ.rear = -1; |
| 11 | +queue newQ; |
| 12 | +newQ.front = -1; |
| 13 | +newQ.rear = -1; |
14 | 14 |
|
15 | | -return newQ; |
| 15 | +return newQ; |
16 | 16 | } |
17 | 17 |
|
18 | 18 | void enqueue(queue* Q, int value) { |
19 | | -Q->container[++Q->rear] = value; |
| 19 | +Q->container[++Q->rear] = value; |
20 | 20 | } |
21 | 21 |
|
22 | 22 | int dequeue(queue* Q) { |
23 | | -if (Q->front == Q->rear) { |
24 | | -printf("This Queue is empty, return value should be ignored."); |
25 | | -return -1; |
26 | | -} |
| 23 | +if (Q->front == Q->rear) { |
| 24 | +printf("This Queue is empty, return value should be ignored."); |
| 25 | +return -1; |
| 26 | +} |
27 | 27 |
|
28 | | -return Q->container[++Q->front]; |
| 28 | +return Q->container[++Q->front]; |
29 | 29 | } |
30 | 30 |
|
31 | 31 | int main(void) { |
32 | | -queue q1 = getNewQueue(); |
| 32 | +queue q1 = getNewQueue(); |
33 | 33 |
|
34 | | -for (int i = 0; i < 10; i++) { |
35 | | -enqueue(&q1, i); |
36 | | -printf("Enqueue : %d\n", i); |
37 | | -} |
| 34 | +for (int i = 0; i < 10; i++) { |
| 35 | +enqueue(&q1, i); |
| 36 | +printf("Enqueue : %d\n", i); |
| 37 | +} |
38 | 38 |
|
39 | | -for (int i = 0; i < 10; i++) { |
40 | | -printf("Dequeue : %d\n", dequeue(&q1)); |
41 | | -} |
| 39 | +for (int i = 0; i < 10; i++) { |
| 40 | +printf("Dequeue : %d\n", dequeue(&q1)); |
| 41 | +} |
42 | 42 |
|
43 | | -return 0; |
| 43 | +return 0; |
44 | 44 | } |
0 commit comments