-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSubvector.cpp
99 lines (88 loc) · 1.36 KB
/
Subvector.cpp
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
#include <iostream>
using namespace std;
class subvector
{
public:
subvector()
{
capacity = 0;
top = 0;
data = new int[0];
}
~subvector()
{
delete[] data;
}
void push_back(int new_element)
{
if (capacity > top)
{
data[top] = new_element;
top++;
}
else
{
int* new_data = new int[capacity * 2];
new_data = data;
new_data[top] = new_element;
top++;
delete[] data;
data = new_data;
}
}
void resize(unsigned int new_capacity)
{
if (new_capacity == capacity)
{
return;
}
else if (new_capacity > capacity)
{
int* new_data = new int[new_capacity];
new_data = data;
delete[] data;
data = new_data;
capacity = new_capacity;
}
else
{
int* new_data = new int[new_capacity];
for (int i = 0; i < new_capacity; i++)
{
new_data[i] = data[i];
}
delete[] data;
data = new_data;
capacity = new_capacity;
top = new_capacity;
}
}
void shrink_to_fit()
{
int* new_data = new int[top];
for (int i = 0; i < top; i++)
{
new_data[i] = data[i];
}
delete[] data;
data = new_data;
capacity = top;
}
void clear()
{
for (int i = 0; i < top; i++)
{
data[i] = 0;
}
capacity = 0;
top = 0;
}
private:
unsigned int capacity;
unsigned int top;
int* data;
};
int main()
{
return 0;
}