Algorithms-4th-C-Coding/ResizeArrayQueue.cpp at master · superlich7/Algorithms-4th-C-Coding · 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
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <iostream>
#include <string>

using namespace std;

template <class Type>
class ResizeArrayQueue
{
	private:
		Type *pItem;
		int  ArrayNum;
		int  ItemNum;

	public:
		ResizeArrayQueue();
		~ResizeArrayQueue();
		void ResizeArray(int size);
		bool IsEmpty();
		void Enqueue(Type item);
		Type Dequeue();
		Type GetFirst();
		Type GetLast();
		void Display();

 };

 template <class Type>
 ResizeArrayQueue<Type>::ResizeArrayQueue()
 {
 	pItem = new Type[1];
    ArrayNum = 1;
    ItemNum  = 0;
 }

 template<class Type>
 ResizeArrayQueue<Type>::~ResizeArrayQueue()
 {
    delete[] pItem;
 }

 template<class Type>
 void ResizeArrayQueue<Type>::ResizeArray(int size)
 {
 	Type *pCopyItem = new Type[size];
 	for(int i=0;i<ItemNum;i++)
        pCopyItem[i] = pItem[i];
    pItem = pCopyItem;
    ArrayNum = size;
 }

 template<class Type>
 bool ResizeArrayQueue<Type>::IsEmpty()
 {
 	return (ItemNum == 0);
 }

 template<class Type>
 void ResizeArrayQueue<Type>::Enqueue(Type item)
 {
    if(ItemNum == ArrayNum)
        ResizeArray(ArrayNum*2);
    pItem[ItemNum++] = item;
 }

 template<class Type>
 Type ResizeArrayQueue<Type>::Dequeue()
 {
    if((ItemNum > 0) && (ItemNum == ArrayNum/4))
        ResizeArray(ArrayNum/2);
    Type item = pItem[0];
    ItemNum--;
    for(int i=0;i<ItemNum;i++)
        pItem[i] = pItem[i+1];

    return item;
 }

 template<class Type>
 Type ResizeArrayQueue<Type>::GetFirst()
 {
 	return pItem[0];
 }

 template<class Type>
 Type ResizeArrayQueue<Type>::GetLast()
 {
 	return pItem[ItemNum-1];
 }

 template <class Type>
 void ResizeArrayQueue<Type>::Display()
 {
 	for(int i=0;i<ItemNum;i++)
 		cout << "current node is " << pItem[i] << endl;
 }

 int main()
 {
 	ResizeArrayQueue<int> oResizeArrayQueue;
 	oResizeArrayQueue.Enqueue(13);
 	oResizeArrayQueue.Enqueue(15);
 	oResizeArrayQueue.Enqueue(22);
 	oResizeArrayQueue.Dequeue();
 	oResizeArrayQueue.Display();

 	ResizeArrayQueue<float> oFloatQueue;
 	oFloatQueue.Enqueue(2.3);
 	oFloatQueue.Enqueue(2.5);
 	oFloatQueue.Dequeue();
 	oFloatQueue.Display();

 	ResizeArrayQueue<string> oStringQueue;
 	oStringQueue.Enqueue("hello ");
 	oStringQueue.Enqueue("world ");
 	oStringQueue.Enqueue("newbee");
 	oStringQueue.Dequeue();
 	oStringQueue.Display();

 	return 1;
 }