/
githubmirror
/
hello-algo
Обзор
Документация
Войти
/
githubmirror
/
hello-algo
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
codes/cpp/chapter_stack_and_queue/array_stack.cpp
85 строк
2 KB
krahets
A bug fix.
19 дек 2023, 16:55
19 дек 2023, 16:55
9a5ab77
Код
Авторство
О чём код?
/** * File: array_stack.cpp * Created Time: 2022-11-28 * Author: qualifier1024 (2539244001@qq.com) */ #include "../utils/common.hpp" /* 基于数组实现的栈 */ class ArrayStack { private: vector<int> stack; public: /* 获取栈的长度 */ int size() { return stack.size(); } /* 判断栈是否为空 */ bool isEmpty() { return stack.size() == 0; } /* 入栈 */ void push(int num) { stack.push_back(num); } /* 出栈 */ int pop() { int num = top(); stack.pop_back(); return num; } /* 访问栈顶元素 */ int top() { if (isEmpty()) throw out_of_range("栈为空"); return stack.back(); } /* 返回 Vector */ vector<int> toVector() { return stack; } }; /* 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 = "; printVector(stack->toVector()); /* 访问栈顶元素 */ int top = stack->top(); cout << "栈顶元素 top = " << top << endl; /* 元素出栈 */ top = stack->pop(); cout << "出栈元素 pop = " << top << "，出栈后 stack = "; printVector(stack->toVector()); /* 获取栈的长度 */ int size = stack->size(); cout << "栈的长度 size = " << size << endl; /* 判断是否为空 */ bool empty = stack->isEmpty(); cout << "栈是否为空 = " << empty << endl; // 释放内存 delete stack; return 0; }