feat: Traditional Chinese version (#1163)

* First commit

* Update mkdocs.yml

* Translate all the docs to traditional Chinese

* Translate the code files.

* Translate the docker file

* Fix mkdocs.yml

* Translate all the figures from SC to TC

* 二叉搜尋樹 -> 二元搜尋樹

* Update terminology.

* Update terminology

* 构造函数/构造方法 -> 建構子
异或 -> 互斥或

* 擴充套件 -> 擴展

* constant - 常量 - 常數

* 類	-> 類別

* AVL -> AVL 樹

* 數組 -> 陣列

* 係統 -> 系統
斐波那契數列 -> 費波那契數列
運算元量 -> 運算量
引數 -> 參數

* 聯絡 -> 關聯

* 麵試 -> 面試

* 面向物件 -> 物件導向
歸併排序 -> 合併排序
范式 -> 範式

* Fix 算法 -> 演算法

* 錶示 -> 表示
反碼 -> 一補數
補碼 -> 二補數
列列尾部 -> 佇列尾部
區域性性 -> 區域性
一摞 -> 一疊

* Synchronize with main branch

* 賬號 -> 帳號
推匯 -> 推導

* Sync with main branch

* First commit

* Update mkdocs.yml

* Translate all the docs to traditional Chinese

* Translate the code files.

* Translate the docker file

* Fix mkdocs.yml

* Translate all the figures from SC to TC

* 二叉搜尋樹 -> 二元搜尋樹

* Update terminology

* 构造函数/构造方法 -> 建構子
异或 -> 互斥或

* 擴充套件 -> 擴展

* constant - 常量 - 常數

* 類	-> 類別

* AVL -> AVL 樹

* 數組 -> 陣列

* 係統 -> 系統
斐波那契數列 -> 費波那契數列
運算元量 -> 運算量
引數 -> 參數

* 聯絡 -> 關聯

* 麵試 -> 面試

* 面向物件 -> 物件導向
歸併排序 -> 合併排序
范式 -> 範式

* Fix 算法 -> 演算法

* 錶示 -> 表示
反碼 -> 一補數
補碼 -> 二補數
列列尾部 -> 佇列尾部
區域性性 -> 區域性
一摞 -> 一疊

* Synchronize with main branch

* 賬號 -> 帳號
推匯 -> 推導

* Sync with main branch

* Update terminology.md

* 操作数量（num. of operations）-> 操作數量

* 字首和->前綴和

* Update figures

* 歸 -> 迴
記憶體洩漏 -> 記憶體流失

* Fix the bug of the file filter

* 支援 -> 支持
Add zh-Hant/README.md

* Add the zh-Hant chapter covers.
Bug fixes.

* 外掛 -> 擴充功能

* Add the landing page for zh-Hant version

* Unify the font of the chapter covers for the zh, en, and zh-Hant version

* Move zh-Hant/ to zh-hant/

* Translate terminology.md to traditional Chinese

zh-hant/codes/cpp/chapter_stack_and_queue/CMakeLists.txt

@@ -0,0 +1,9 @@
+add_executable(array_deque array_deque.cpp)
+add_executable(array_queue array_queue.cpp)
+add_executable(array_stack array_stack.cpp)
+add_executable(deque deque.cpp)
+add_executable(linkedlist_deque linkedlist_deque.cpp)
+add_executable(linkedlist_queue linkedlist_queue.cpp)
+add_executable(linkedlist_stack linkedlist_stack.cpp)
+add_executable(queue queue.cpp)
+add_executable(stack stack.cpp)

zh-hant/codes/cpp/chapter_stack_and_queue/array_deque.cpp

@@ -0,0 +1,156 @@
+/**
+ * File: array_deque.cpp
+ * Created Time: 2023-03-02
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 基於環形陣列實現的雙向佇列 */
+class ArrayDeque {
+  private:
+    vector<int> nums; // 用於儲存雙向佇列元素的陣列
+    int front;        // 佇列首指標，指向佇列首元素
+    int queSize;      // 雙向佇列長度
+
+  public:
+    /* 建構子 */
+    ArrayDeque(int capacity) {
+        nums.resize(capacity);
+        front = queSize = 0;
+    }
+
+    /* 獲取雙向佇列的容量 */
+    int capacity() {
+        return nums.size();
+    }
+
+    /* 獲取雙向佇列的長度 */
+    int size() {
+        return queSize;
+    }
+
+    /* 判斷雙向佇列是否為空 */
+    bool isEmpty() {
+        return queSize == 0;
+    }
+
+    /* 計算環形陣列索引 */
+    int index(int i) {
+        // 透過取餘操作實現陣列首尾相連
+        // 當 i 越過陣列尾部後，回到頭部
+        // 當 i 越過陣列頭部後，回到尾部
+        return (i + capacity()) % capacity();
+    }
+
+    /* 佇列首入列 */
+    void pushFirst(int num) {
+        if (queSize == capacity()) {
+            cout << "雙向佇列已滿" << endl;
+            return;
+        }
+        // 佇列首指標向左移動一位
+        // 透過取餘操作實現 front 越過陣列頭部後回到尾部
+        front = index(front - 1);
+        // 將 num 新增至佇列首
+        nums[front] = num;
+        queSize++;
+    }
+
+    /* 佇列尾入列 */
+    void pushLast(int num) {
+        if (queSize == capacity()) {
+            cout << "雙向佇列已滿" << endl;
+            return;
+        }
+        // 計算佇列尾指標，指向佇列尾索引 + 1
+        int rear = index(front + queSize);
+        // 將 num 新增至佇列尾
+        nums[rear] = num;
+        queSize++;
+    }
+
+    /* 佇列首出列 */
+    int popFirst() {
+        int num = peekFirst();
+        // 佇列首指標向後移動一位
+        front = index(front + 1);
+        queSize--;
+        return num;
+    }
+
+    /* 佇列尾出列 */
+    int popLast() {
+        int num = peekLast();
+        queSize--;
+        return num;
+    }
+
+    /* 訪問佇列首元素 */
+    int peekFirst() {
+        if (isEmpty())
+            throw out_of_range("雙向佇列為空");
+        return nums[front];
+    }
+
+    /* 訪問佇列尾元素 */
+    int peekLast() {
+        if (isEmpty())
+            throw out_of_range("雙向佇列為空");
+        // 計算尾元素索引
+        int last = index(front + queSize - 1);
+        return nums[last];
+    }
+
+    /* 返回陣列用於列印 */
+    vector<int> toVector() {
+        // 僅轉換有效長度範圍內的串列元素
+        vector<int> res(queSize);
+        for (int i = 0, j = front; i < queSize; i++, j++) {
+            res[i] = nums[index(j)];
+        }
+        return res;
+    }
+};
+
+/* Driver Code */
+int main() {
+    /* 初始化雙向佇列 */
+    ArrayDeque *deque = new ArrayDeque(10);
+    deque->pushLast(3);
+    deque->pushLast(2);
+    deque->pushLast(5);
+    cout << "雙向佇列 deque = ";
+    printVector(deque->toVector());
+
+    /* 訪問元素 */
+    int peekFirst = deque->peekFirst();
+    cout << "佇列首元素 peekFirst = " << peekFirst << endl;
+    int peekLast = deque->peekLast();
+    cout << "佇列尾元素 peekLast = " << peekLast << endl;
+
+    /* 元素入列 */
+    deque->pushLast(4);
+    cout << "元素 4 佇列尾入列後 deque = ";
+    printVector(deque->toVector());
+    deque->pushFirst(1);
+    cout << "元素 1 佇列首入列後 deque = ";
+    printVector(deque->toVector());
+
+    /* 元素出列 */
+    int popLast = deque->popLast();
+    cout << "佇列尾出列元素 = " << popLast << "，佇列尾出列後 deque = ";
+    printVector(deque->toVector());
+    int popFirst = deque->popFirst();
+    cout << "佇列首出列元素 = " << popFirst << "，佇列首出列後 deque = ";
+    printVector(deque->toVector());
+
+    /* 獲取雙向佇列的長度 */
+    int size = deque->size();
+    cout << "雙向佇列長度 size = " << size << endl;
+
+    /* 判斷雙向佇列是否為空 */
+    bool isEmpty = deque->isEmpty();
+    cout << "雙向佇列是否為空 = " << boolalpha << isEmpty << endl;
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/array_queue.cpp

@@ -0,0 +1,129 @@
+/**
+ * File: array_queue.cpp
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 基於環形陣列實現的佇列 */
+class ArrayQueue {
+  private:
+    int *nums;       // 用於儲存佇列元素的陣列
+    int front;       // 佇列首指標，指向佇列首元素
+    int queSize;     // 佇列長度
+    int queCapacity; // 佇列容量
+
+  public:
+    ArrayQueue(int capacity) {
+        // 初始化陣列
+        nums = new int[capacity];
+        queCapacity = capacity;
+        front = queSize = 0;
+    }
+
+    ~ArrayQueue() {
+        delete[] nums;
+    }
+
+    /* 獲取佇列的容量 */
+    int capacity() {
+        return queCapacity;
+    }
+
+    /* 獲取佇列的長度 */
+    int size() {
+        return queSize;
+    }
+
+    /* 判斷佇列是否為空 */
+    bool isEmpty() {
+        return size() == 0;
+    }
+
+    /* 入列 */
+    void push(int num) {
+        if (queSize == queCapacity) {
+            cout << "佇列已滿" << endl;
+            return;
+        }
+        // 計算佇列尾指標，指向佇列尾索引 + 1
+        // 透過取餘操作實現 rear 越過陣列尾部後回到頭部
+        int rear = (front + queSize) % queCapacity;
+        // 將 num 新增至佇列尾
+        nums[rear] = num;
+        queSize++;
+    }
+
+    /* 出列 */
+    int pop() {
+        int num = peek();
+        // 佇列首指標向後移動一位，若越過尾部，則返回到陣列頭部
+        front = (front + 1) % queCapacity;
+        queSize--;
+        return num;
+    }
+
+    /* 訪問佇列首元素 */
+    int peek() {
+        if (isEmpty())
+            throw out_of_range("佇列為空");
+        return nums[front];
+    }
+
+    /* 將陣列轉化為 Vector 並返回 */
+    vector<int> toVector() {
+        // 僅轉換有效長度範圍內的串列元素
+        vector<int> arr(queSize);
+        for (int i = 0, j = front; i < queSize; i++, j++) {
+            arr[i] = nums[j % queCapacity];
+        }
+        return arr;
+    }
+};
+
+/* Driver Code */
+int main() {
+    /* 初始化佇列 */
+    int capacity = 10;
+    ArrayQueue *queue = new ArrayQueue(capacity);
+
+    /* 元素入列 */
+    queue->push(1);
+    queue->push(3);
+    queue->push(2);
+    queue->push(5);
+    queue->push(4);
+    cout << "佇列 queue = ";
+    printVector(queue->toVector());
+
+    /* 訪問佇列首元素 */
+    int peek = queue->peek();
+    cout << "佇列首元素 peek = " << peek << endl;
+
+    /* 元素出列 */
+    peek = queue->pop();
+    cout << "出列元素 pop = " << peek << "，出列後 queue = ";
+    printVector(queue->toVector());
+
+    /* 獲取佇列的長度 */
+    int size = queue->size();
+    cout << "佇列長度 size = " << size << endl;
+
+    /* 判斷佇列是否為空 */
+    bool empty = queue->isEmpty();
+    cout << "佇列是否為空 = " << empty << endl;
+
+    /* 測試環形陣列 */
+    for (int i = 0; i < 10; i++) {
+        queue->push(i);
+        queue->pop();
+        cout << "第 " << i << " 輪入列 + 出列後 queue = ";
+        printVector(queue->toVector());
+    }
+
+    // 釋放記憶體
+    delete queue;
+
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/array_stack.cpp

@@ -0,0 +1,85 @@
+/**
+ * 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;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/deque.cpp

@@ -0,0 +1,46 @@
+/**
+ * File: deque.cpp
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* Driver Code */
+int main() {
+    /* 初始化雙向佇列 */
+    deque<int> deque;
+
+    /* 元素入列 */
+    deque.push_back(2);
+    deque.push_back(5);
+    deque.push_back(4);
+    deque.push_front(3);
+    deque.push_front(1);
+    cout << "雙向佇列 deque = ";
+    printDeque(deque);
+
+    /* 訪問元素 */
+    int front = deque.front();
+    cout << "佇列首元素 front = " << front << endl;
+    int back = deque.back();
+    cout << "佇列尾元素 back = " << back << endl;
+
+    /* 元素出列 */
+    deque.pop_front();
+    cout << "佇列首出列元素 popFront = " << front << "，佇列首出列後 deque = ";
+    printDeque(deque);
+    deque.pop_back();
+    cout << "佇列尾出列元素 popLast = " << back << "，佇列尾出列後 deque = ";
+    printDeque(deque);
+
+    /* 獲取雙向佇列的長度 */
+    int size = deque.size();
+    cout << "雙向佇列長度 size = " << size << endl;
+
+    /* 判斷雙向佇列是否為空 */
+    bool empty = deque.empty();
+    cout << "雙向佇列是否為空 = " << empty << endl;
+
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/linkedlist_deque.cpp

@@ -0,0 +1,194 @@
+/**
+ * File: linkedlist_deque.cpp
+ * Created Time: 2023-03-02
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 雙向鏈結串列節點 */
+struct DoublyListNode {
+    int val;              // 節點值
+    DoublyListNode *next; // 後繼節點指標
+    DoublyListNode *prev; // 前驅節點指標
+    DoublyListNode(int val) : val(val), prev(nullptr), next(nullptr) {
+    }
+};
+
+/* 基於雙向鏈結串列實現的雙向佇列 */
+class LinkedListDeque {
+  private:
+    DoublyListNode *front, *rear; // 頭節點 front ，尾節點 rear
+    int queSize = 0;              // 雙向佇列的長度
+
+  public:
+    /* 建構子 */
+    LinkedListDeque() : front(nullptr), rear(nullptr) {
+    }
+
+    /* 析構方法 */
+    ~LinkedListDeque() {
+        // 走訪鏈結串列刪除節點，釋放記憶體
+        DoublyListNode *pre, *cur = front;
+        while (cur != nullptr) {
+            pre = cur;
+            cur = cur->next;
+            delete pre;
+        }
+    }
+
+    /* 獲取雙向佇列的長度 */
+    int size() {
+        return queSize;
+    }
+
+    /* 判斷雙向佇列是否為空 */
+    bool isEmpty() {
+        return size() == 0;
+    }
+
+    /* 入列操作 */
+    void push(int num, bool isFront) {
+        DoublyListNode *node = new DoublyListNode(num);
+        // 若鏈結串列為空，則令 front 和 rear 都指向 node
+        if (isEmpty())
+            front = rear = node;
+        // 佇列首入列操作
+        else if (isFront) {
+            // 將 node 新增至鏈結串列頭部
+            front->prev = node;
+            node->next = front;
+            front = node; // 更新頭節點
+        // 佇列尾入列操作
+        } else {
+            // 將 node 新增至鏈結串列尾部
+            rear->next = node;
+            node->prev = rear;
+            rear = node; // 更新尾節點
+        }
+        queSize++; // 更新佇列長度
+    }
+
+    /* 佇列首入列 */
+    void pushFirst(int num) {
+        push(num, true);
+    }
+
+    /* 佇列尾入列 */
+    void pushLast(int num) {
+        push(num, false);
+    }
+
+    /* 出列操作 */
+    int pop(bool isFront) {
+        if (isEmpty())
+            throw out_of_range("佇列為空");
+        int val;
+        // 佇列首出列操作
+        if (isFront) {
+            val = front->val; // 暫存頭節點值
+            // 刪除頭節點
+            DoublyListNode *fNext = front->next;
+            if (fNext != nullptr) {
+                fNext->prev = nullptr;
+                front->next = nullptr;
+            }
+            delete front;
+            front = fNext; // 更新頭節點
+        // 佇列尾出列操作
+        } else {
+            val = rear->val; // 暫存尾節點值
+            // 刪除尾節點
+            DoublyListNode *rPrev = rear->prev;
+            if (rPrev != nullptr) {
+                rPrev->next = nullptr;
+                rear->prev = nullptr;
+            }
+            delete rear;
+            rear = rPrev; // 更新尾節點
+        }
+        queSize--; // 更新佇列長度
+        return val;
+    }
+
+    /* 佇列首出列 */
+    int popFirst() {
+        return pop(true);
+    }
+
+    /* 佇列尾出列 */
+    int popLast() {
+        return pop(false);
+    }
+
+    /* 訪問佇列首元素 */
+    int peekFirst() {
+        if (isEmpty())
+            throw out_of_range("雙向佇列為空");
+        return front->val;
+    }
+
+    /* 訪問佇列尾元素 */
+    int peekLast() {
+        if (isEmpty())
+            throw out_of_range("雙向佇列為空");
+        return rear->val;
+    }
+
+    /* 返回陣列用於列印 */
+    vector<int> toVector() {
+        DoublyListNode *node = front;
+        vector<int> res(size());
+        for (int i = 0; i < res.size(); i++) {
+            res[i] = node->val;
+            node = node->next;
+        }
+        return res;
+    }
+};
+
+/* Driver Code */
+int main() {
+    /* 初始化雙向佇列 */
+    LinkedListDeque *deque = new LinkedListDeque();
+    deque->pushLast(3);
+    deque->pushLast(2);
+    deque->pushLast(5);
+    cout << "雙向佇列 deque = ";
+    printVector(deque->toVector());
+
+    /* 訪問元素 */
+    int peekFirst = deque->peekFirst();
+    cout << "佇列首元素 peekFirst = " << peekFirst << endl;
+    int peekLast = deque->peekLast();
+    cout << "佇列尾元素 peekLast = " << peekLast << endl;
+
+    /* 元素入列 */
+    deque->pushLast(4);
+    cout << "元素 4 佇列尾入列後 deque =";
+    printVector(deque->toVector());
+    deque->pushFirst(1);
+    cout << "元素 1 佇列首入列後 deque = ";
+    printVector(deque->toVector());
+
+    /* 元素出列 */
+    int popLast = deque->popLast();
+    cout << "佇列尾出列元素 = " << popLast << "，佇列尾出列後 deque = ";
+    printVector(deque->toVector());
+    int popFirst = deque->popFirst();
+    cout << "佇列首出列元素 = " << popFirst << "，佇列首出列後 deque = ";
+    printVector(deque->toVector());
+
+    /* 獲取雙向佇列的長度 */
+    int size = deque->size();
+    cout << "雙向佇列長度 size = " << size << endl;
+
+    /* 判斷雙向佇列是否為空 */
+    bool isEmpty = deque->isEmpty();
+    cout << "雙向佇列是否為空 = " << boolalpha << isEmpty << endl;
+
+    // 釋放記憶體
+    delete deque;
+
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp

@@ -0,0 +1,120 @@
+/**
+ * File: linkedlist_queue.cpp
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 基於鏈結串列實現的佇列 */
+class LinkedListQueue {
+  private:
+    ListNode *front, *rear; // 頭節點 front ，尾節點 rear
+    int queSize;
+
+  public:
+    LinkedListQueue() {
+        front = nullptr;
+        rear = nullptr;
+        queSize = 0;
+    }
+
+    ~LinkedListQueue() {
+        // 走訪鏈結串列刪除節點，釋放記憶體
+        freeMemoryLinkedList(front);
+    }
+
+    /* 獲取佇列的長度 */
+    int size() {
+        return queSize;
+    }
+
+    /* 判斷佇列是否為空 */
+    bool isEmpty() {
+        return queSize == 0;
+    }
+
+    /* 入列 */
+    void push(int num) {
+        // 在尾節點後新增 num
+        ListNode *node = new ListNode(num);
+        // 如果佇列為空，則令頭、尾節點都指向該節點
+        if (front == nullptr) {
+            front = node;
+            rear = node;
+        }
+        // 如果佇列不為空，則將該節點新增到尾節點後
+        else {
+            rear->next = node;
+            rear = node;
+        }
+        queSize++;
+    }
+
+    /* 出列 */
+    int pop() {
+        int num = peek();
+        // 刪除頭節點
+        ListNode *tmp = front;
+        front = front->next;
+        // 釋放記憶體
+        delete tmp;
+        queSize--;
+        return num;
+    }
+
+    /* 訪問佇列首元素 */
+    int peek() {
+        if (size() == 0)
+            throw out_of_range("佇列為空");
+        return front->val;
+    }
+
+    /* 將鏈結串列轉化為 Vector 並返回 */
+    vector<int> toVector() {
+        ListNode *node = front;
+        vector<int> res(size());
+        for (int i = 0; i < res.size(); i++) {
+            res[i] = node->val;
+            node = node->next;
+        }
+        return res;
+    }
+};
+
+/* Driver Code */
+int main() {
+    /* 初始化佇列 */
+    LinkedListQueue *queue = new LinkedListQueue();
+
+    /* 元素入列 */
+    queue->push(1);
+    queue->push(3);
+    queue->push(2);
+    queue->push(5);
+    queue->push(4);
+    cout << "佇列 queue = ";
+    printVector(queue->toVector());
+
+    /* 訪問佇列首元素 */
+    int peek = queue->peek();
+    cout << "佇列首元素 peek = " << peek << endl;
+
+    /* 元素出列 */
+    peek = queue->pop();
+    cout << "出列元素 pop = " << peek << "，出列後 queue = ";
+    printVector(queue->toVector());
+
+    /* 獲取佇列的長度 */
+    int size = queue->size();
+    cout << "佇列長度 size = " << size << endl;
+
+    /* 判斷佇列是否為空 */
+    bool empty = queue->isEmpty();
+    cout << "佇列是否為空 = " << empty << endl;
+
+    // 釋放記憶體
+    delete queue;
+
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp

@@ -0,0 +1,109 @@
+/**
+ * File: linkedlist_stack.cpp
+ * Created Time: 2022-11-28
+ * Author: qualifier1024 (2539244001@qq.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 基於鏈結串列實現的堆疊 */
+class LinkedListStack {
+  private:
+    ListNode *stackTop; // 將頭節點作為堆疊頂
+    int stkSize;        // 堆疊的長度
+
+  public:
+    LinkedListStack() {
+        stackTop = nullptr;
+        stkSize = 0;
+    }
+
+    ~LinkedListStack() {
+        // 走訪鏈結串列刪除節點，釋放記憶體
+        freeMemoryLinkedList(stackTop);
+    }
+
+    /* 獲取堆疊的長度 */
+    int size() {
+        return stkSize;
+    }
+
+    /* 判斷堆疊是否為空 */
+    bool isEmpty() {
+        return size() == 0;
+    }
+
+    /* 入堆疊 */
+    void push(int num) {
+        ListNode *node = new ListNode(num);
+        node->next = stackTop;
+        stackTop = node;
+        stkSize++;
+    }
+
+    /* 出堆疊 */
+    int pop() {
+        int num = top();
+        ListNode *tmp = stackTop;
+        stackTop = stackTop->next;
+        // 釋放記憶體
+        delete tmp;
+        stkSize--;
+        return num;
+    }
+
+    /* 訪問堆疊頂元素 */
+    int top() {
+        if (isEmpty())
+            throw out_of_range("堆疊為空");
+        return stackTop->val;
+    }
+
+    /* 將 List 轉化為 Array 並返回 */
+    vector<int> toVector() {
+        ListNode *node = stackTop;
+        vector<int> res(size());
+        for (int i = res.size() - 1; i >= 0; i--) {
+            res[i] = node->val;
+            node = node->next;
+        }
+        return res;
+    }
+};
+
+/* Driver Code */
+int main() {
+    /* 初始化堆疊 */
+    LinkedListStack *stack = new LinkedListStack();
+
+    /* 元素入堆疊 */
+    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;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/queue.cpp

@@ -0,0 +1,41 @@
+/**
+ * File: queue.cpp
+ * Created Time: 2022-11-28
+ * Author: qualifier1024 (2539244001@qq.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* Driver Code */
+int main() {
+    /* 初始化佇列 */
+    queue<int> queue;
+
+    /* 元素入列 */
+    queue.push(1);
+    queue.push(3);
+    queue.push(2);
+    queue.push(5);
+    queue.push(4);
+    cout << "佇列 queue = ";
+    printQueue(queue);
+
+    /* 訪問佇列首元素 */
+    int front = queue.front();
+    cout << "佇列首元素 front = " << front << endl;
+
+    /* 元素出列 */
+    queue.pop();
+    cout << "出列元素 front = " << front << "，出列後 queue = ";
+    printQueue(queue);
+
+    /* 獲取佇列的長度 */
+    int size = queue.size();
+    cout << "佇列長度 size = " << size << endl;
+
+    /* 判斷佇列是否為空 */
+    bool empty = queue.empty();
+    cout << "佇列是否為空 = " << empty << endl;
+
+    return 0;
+}

zh-hant/codes/cpp/chapter_stack_and_queue/stack.cpp

@@ -0,0 +1,41 @@
+/**
+ * File: stack.cpp
+ * Created Time: 2022-11-28
+ * Author: qualifier1024 (2539244001@qq.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* Driver Code */
+int main() {
+    /* 初始化堆疊 */
+    stack<int> stack;
+
+    /* 元素入堆疊 */
+    stack.push(1);
+    stack.push(3);
+    stack.push(2);
+    stack.push(5);
+    stack.push(4);
+    cout << "堆疊 stack = ";
+    printStack(stack);
+
+    /* 訪問堆疊頂元素 */
+    int top = stack.top();
+    cout << "堆疊頂元素 top = " << top << endl;
+
+    /* 元素出堆疊 */
+    stack.pop(); // 無返回值
+    cout << "出堆疊元素 pop = " << top << "，出堆疊後 stack = ";
+    printStack(stack);
+
+    /* 獲取堆疊的長度 */
+    int size = stack.size();
+    cout << "堆疊的長度 size = " << size << endl;
+
+    /* 判斷是否為空 */
+    bool empty = stack.empty();
+    cout << "堆疊是否為空 = " << empty << endl;
+
+    return 0;
+}