update stack

Author: bitdove

README.md

@@ -24,6 +24,8 @@ Remember that each data has its own trade-offs. And you need to pay attention mo
 * `B` [Linked List](data-structures/LinkedList)
 * `B` [Doubly Linked List](data-structures/DoublyLinkedList)
 * `B` [Queue](data-structures/Queue)
+* `B` [Stack](data-structures/Stack)
+
 
 ## Algorithms
 

README.zh-CN.md

@@ -21,6 +21,8 @@
 * `B` [单链表](data-structures/LinkedList)
 * `B` [双链表](data-structures/DoublyLinkedList)
 * `B` [队列](data-structures/Queue)
+* `B` [栈](data-structures/Stack)
+
 
 
 ## 算法

data-structures/Queue/include/Queue.h

@@ -1,17 +1,15 @@
 #ifndef QUEUE_H
 #define QUEUE_H
-
+/*
+ * We're going to implement Queue based on LinkedList since the two
+ * structures are quite similar. Namely, they both operate mostly on
+ * the elements at the beginning and the end. Compare push/pop
+ * operations of Queue with push_back/pop_front operations of LinkedList.
+*/
 #include <stdexcept>
 #include <cstddef>
 #include "../../LinkedList/include/LinkedList.h"
 
-/*
-  We're going to implement Queue based on LinkedList since the two
-  structures are quite similar. Namely, they both operate mostly on
-  the elements at the beginning and the end. Compare push/pop
-  operations of Queue with push_back/pop_front operations of LinkedList.
-*/
-
 template <typename T>
 class Queue{
   public:

data-structures/Stack/CMakeLists.txt

@@ -0,0 +1,21 @@
+# Specify the minimum version of CMake required
+cmake_minimum_required(VERSION 3.10)
+
+# Project name and version
+project(StackProject VERSION 1.0)
+
+# Set C++ standard
+set(CMAKE_CXX_STANDARD 11)
+set(CMAKE_CXX_STANDARD_REQUIRED True)
+
+# Include directories
+include_directories(include)
+
+# Output executables to the 'bin' directory
+set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/../bin)
+
+# Add the test executable
+add_executable(test_Stack __test__/test_Stack.cpp)
+
+# Link the LinkedList library to the test executable
+target_link_libraries(test_Stack)

data-structures/Stack/README.md

@@ -0,0 +1,23 @@
+# 栈
+
+在计算机科学中, 一个 **栈(stack)** 是一种抽象数据类型,用作表示元素的集合,具有两种主要操作:
+
+* **push**, 添加元素到栈的顶端(末尾);
+* **pop**, 移除栈最顶端(末尾)的元素.
+
+以上两种操作可以简单概括为“后进先出(LIFO = last in, first out)”。
+
+此外,应有一个 `peek` 操作用于访问栈当前顶端(末尾)的元素。
+
+"栈"这个名称,可类比于一组物体的堆叠(一摞书,一摞盘子之类的)。
+
+栈的 push 和 pop 操作的示意
+
+![Stack](./assets/stack.jpeg)
+
+*Made with [okso.app](https://okso.app)*
+
+## 参考
+
+- [Wikipedia](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))
+- [YouTube](https://www.youtube.com/watch?v=wjI1WNcIntg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=3&)

data-structures/Stack/__test__/test_Stack.cpp

@@ -0,0 +1 @@
+#include "../include/Stack.h"

data-structures/Stack/assets/stack.jpeg

@@ -0,0 +1,19 @@
+#!/bin/bash
+
+# Create the build directory if it doesn't exist
+if [ ! -d "build" ]; then
+  mkdir build
+fi
+
+# Run CMake in the build directory
+cd build
+cmake ..
+
+# Build the project using make
+make
+
+# Return to the project root directory
+cd ..
+
+# Inform the user where the executable can be found
+echo "Build complete. Executable located in the ./bin directory."

data-structures/Stack/build.sh

@@ -0,0 +1,7 @@
+#!/bin/bash
+
+# Remove build and bin directories
+rm -rf build
+rm -rf bin
+
+echo "Clean complete. Build and bin directories removed."

data-structures/Stack/clean.sh

@@ -0,0 +1,30 @@
+#ifndef STACK_H
+#define STACK_H
+/*
+ * We're going to implement Stack based on LinkedList since these
+ * tructures are quite similar. Compare push/pop operations of the Stack
+ * with push_front/pop_front operations of LinkedList.
+*/ 
+#include "../../LinkedList/include/LinkedList.h"
+#include <cstddef>
+#include <stdexcept>
+
+template <typename T>
+class Stack{
+  public:
+    // Capacity
+    bool empty();
+    size_t size();
+    // Add
+    void push(T& value);
+    // Delete
+    void pop();
+    // Check
+    void top();
+  private:
+    LinkedList<T> list;
+};
+
+
+
+#endif // STACK_H