FilesExpand file tree

 master

/

demo_array_queue_1.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

105 lines (82 loc) · 1.93 KB

 master

/

demo_array_queue_1.c

Copy path

Top

File metadata and controls

• Code
• Blame

105 lines (82 loc) · 1.93 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

#include <stdio.h>

#include <stdlib.h>

#include "demo_array_queue_1.h"

#define bool int

#define true 1

#define false -1

arrayQueue *create_queue(int size) {

arrayQueue *queue = (arrayQueue *)malloc(sizeof(arrayQueue));

if (queue == NULL) {

return NULL;

}

queue->max = size;

queue->tail = 0;

queue->head = 0;

queue->array = (int *)malloc(sizeof(int) * size);

if (queue->array == NULL) {

return NULL;

}

return queue;

}

// 入队

bool enqueue(arrayQueue *queue, int data) {

if (queue == NULL) {

return false;

}

if (_is_full(queue)) {

if (queue->head == 0) return false;

// 数据搬移

int i;

for (i = queue->head; i < queue->tail; ++i) {

queue->array[i - queue->head] = queue->array[i];

}

// 搬移之后重新更新 head 和 tail

queue->tail -= queue->head;

queue->head = 0;

}

queue->array[queue->tail] = data;

++queue->tail;

return true;

}

// 出队

int dequeue(arrayQueue *queue) {

if (queue == NULL) {

return false;

}

if (_is_empty(queue)) {

return false;

}

int ret = queue->array[queue->head];

++queue->head;

return ret;

}

void queue_free(arrayQueue *queue) {

if (queue == NULL) {

return;

}

if (queue->array == NULL) {

return;

}

free(queue->array);

free(queue);

}

void test_array_queue_1(arrayQueue *queue, int size) {

int i;

for (i = 0 ; i < size; i++) {

enqueue(queue, i);

}

// enqueue(queue, 3);

for (i = 0 ; i < size; i++) {

printf("dequeue val: %d\n", dequeue(queue));

}

enqueue(queue, 9);

printf("dequeue val: %d\n", dequeue(queue));

// printf("dequeue val: %d\n", dequeue(queue));

}

int main () {

int size = 8;

arrayQueue *queue = create_queue(size);

test_array_queue_1(queue, size);

queue_free(queue);

return 0;

}