Update array_stack.cpp

仿照linkedlist_stack实现的array_stack,补上了测试代码
This commit is contained in:
qualifier1024 2022-11-28 22:23:27 +08:00 committed by GitHub
parent f351987887
commit f772e28acb
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -1,8 +1,74 @@
/*
* File: array_stack.cpp
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
* Created Time: 2022-11-28
* Author: qualifier1024 (2539244001@qq.com)
*/
#include "../include/include.hpp"
/* 基于数组实现的栈 */
class ArrayStack {
public:
vector<int> vec;
/* 获取栈的长度 */
int size() {
return vec.size();
}
/* 判断栈是否为空 */
bool empty() {
return vec.empty();
}
/* 入栈 */
void push(int num) {
vec.push_back(num);
}
/* 出栈 */
int pop() {
int oldTop = vec.back();
vec.pop_back();
return oldTop;
}
/* 访问栈顶元素 */
int top() {
return vec.back();
}
};
/* Driver Code */
int main() {
/* 初始化栈 */
ArrayStack* stack = new ArrayStack();
/* 元素入栈 */
stack->push(1);
stack->push(3);
stack->push(2);
stack->push(5);
stack->push(4);
cout << "栈 stack = ";
PrintUtil::printVector(stack->vec);
/* 访问栈顶元素 */
int top = stack->top();
cout << "栈顶元素 top = " << top << endl;
/* 元素出栈 */
int pop = stack->pop();
cout << "出栈元素 pop = " << pop << ",出栈后 stack = ";
PrintUtil::printVector(stack->vec);
/* 获取栈的长度 */
int size = stack->size();
cout << "栈的长度 size = " << size << endl;
/* 判断是否为空 */
bool empty = stack->empty();
cout << "栈是否为空 = " << empty << endl;
return 0;
}