algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-05 21:19:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the structure of the chapter

Browse Source 
of binary tree.
This commit is contained in:
Yudong Jin
2022-12-21 17:19:39 +08:00
parent f3ef226874
commit f39636cb63
22 changed files with 402 additions and 572 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
codes/cpp/chapter_stack_and_queue/array_stack.cpp
View File

@ -41,13 +41,6 @@ public:
return stack.back();
}
/* 访问索引 index 处元素 */
int get(int index) {
if(index >= size())
throw out_of_range("索引越界");
return stack[index];
}
/* 返回 Vector */
vector<int> toVector() {
return stack;
@ -73,10 +66,6 @@ int main() {
int top = stack->top();
cout << "栈顶元素 top = " << top << endl;
/* 访问索引 index 处元素 */
int num = stack->get(3);
cout << "栈索引 3 处的元素为 num = " << num << endl;
/* 元素出栈 */
int pop = stack->pop();
cout << "出栈元素 pop = " << pop << "，出栈后 stack = ";