mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-25 12:36:07 +00:00
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
This commit is contained in:
Yudong Jin
@@ -0,0 +1,6 @@
|
||||
add_executable(array_stack array_stack.c)
|
||||
add_executable(linkedlist_stack linkedlist_stack.c)
|
||||
add_executable(array_queue array_queue.c)
|
||||
add_executable(linkedlist_queue linkedlist_queue.c)
|
||||
add_executable(array_deque array_deque.c)
|
||||
add_executable(linkedlist_deque linkedlist_deque.c)
|
||||
@@ -0,0 +1,159 @@
|
||||
/**
|
||||
* File: array_deque.c
|
||||
* Created Time: 2023-03-13
|
||||
* Author: Gonglja (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
/* 基於環形陣列實現的雙向佇列 */
|
||||
typedef struct {
|
||||
int *nums; // 用於儲存佇列元素的陣列
|
||||
int front; // 佇列首指標，指向佇列首元素
|
||||
int queSize; // 尾指標，指向佇列尾 + 1
|
||||
int queCapacity; // 佇列容量
|
||||
} ArrayDeque;
|
||||
|
||||
/* 建構子 */
|
||||
ArrayDeque *newArrayDeque(int capacity) {
|
||||
ArrayDeque *deque = (ArrayDeque *)malloc(sizeof(ArrayDeque));
|
||||
// 初始化陣列
|
||||
deque->queCapacity = capacity;
|
||||
deque->nums = (int *)malloc(sizeof(int) * deque->queCapacity);
|
||||
deque->front = deque->queSize = 0;
|
||||
return deque;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delArrayDeque(ArrayDeque *deque) {
|
||||
free(deque->nums);
|
||||
free(deque);
|
||||
}
|
||||
|
||||
/* 獲取雙向佇列的容量 */
|
||||
int capacity(ArrayDeque *deque) {
|
||||
return deque->queCapacity;
|
||||
}
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
int size(ArrayDeque *deque) {
|
||||
return deque->queSize;
|
||||
}
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
bool empty(ArrayDeque *deque) {
|
||||
return deque->queSize == 0;
|
||||
}
|
||||
|
||||
/* 計算環形陣列索引 */
|
||||
int dequeIndex(ArrayDeque *deque, int i) {
|
||||
// 透過取餘操作實現陣列首尾相連
|
||||
// 當 i 越過陣列尾部時，回到頭部
|
||||
// 當 i 越過陣列頭部後，回到尾部
|
||||
return ((i + capacity(deque)) % capacity(deque));
|
||||
}
|
||||
|
||||
/* 佇列首入列 */
|
||||
void pushFirst(ArrayDeque *deque, int num) {
|
||||
if (deque->queSize == capacity(deque)) {
|
||||
printf("雙向佇列已滿\r\n");
|
||||
return;
|
||||
}
|
||||
// 佇列首指標向左移動一位
|
||||
// 透過取餘操作實現 front 越過陣列頭部回到尾部
|
||||
deque->front = dequeIndex(deque, deque->front - 1);
|
||||
// 將 num 新增到佇列首
|
||||
deque->nums[deque->front] = num;
|
||||
deque->queSize++;
|
||||
}
|
||||
|
||||
/* 佇列尾入列 */
|
||||
void pushLast(ArrayDeque *deque, int num) {
|
||||
if (deque->queSize == capacity(deque)) {
|
||||
printf("雙向佇列已滿\r\n");
|
||||
return;
|
||||
}
|
||||
// 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
int rear = dequeIndex(deque, deque->front + deque->queSize);
|
||||
// 將 num 新增至佇列尾
|
||||
deque->nums[rear] = num;
|
||||
deque->queSize++;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peekFirst(ArrayDeque *deque) {
|
||||
// 訪問異常：雙向佇列為空
|
||||
assert(empty(deque) == 0);
|
||||
return deque->nums[deque->front];
|
||||
}
|
||||
|
||||
/* 訪問佇列尾元素 */
|
||||
int peekLast(ArrayDeque *deque) {
|
||||
// 訪問異常：雙向佇列為空
|
||||
assert(empty(deque) == 0);
|
||||
int last = dequeIndex(deque, deque->front + deque->queSize - 1);
|
||||
return deque->nums[last];
|
||||
}
|
||||
|
||||
/* 佇列首出列 */
|
||||
int popFirst(ArrayDeque *deque) {
|
||||
int num = peekFirst(deque);
|
||||
// 佇列首指標向後移動一位
|
||||
deque->front = dequeIndex(deque, deque->front + 1);
|
||||
deque->queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 佇列尾出列 */
|
||||
int popLast(ArrayDeque *deque) {
|
||||
int num = peekLast(deque);
|
||||
deque->queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化佇列 */
|
||||
int capacity = 10;
|
||||
ArrayDeque *deque = newArrayDeque(capacity);
|
||||
pushLast(deque, 3);
|
||||
pushLast(deque, 2);
|
||||
pushLast(deque, 5);
|
||||
printf("雙向佇列 deque = ");
|
||||
printArray(deque->nums, deque->queSize);
|
||||
|
||||
/* 訪問元素 */
|
||||
int peekFirstNum = peekFirst(deque);
|
||||
printf("佇列首元素 peekFirst = %d\r\n", peekFirstNum);
|
||||
int peekLastNum = peekLast(deque);
|
||||
printf("佇列尾元素 peekLast = %d\r\n", peekLastNum);
|
||||
|
||||
/* 元素入列 */
|
||||
pushLast(deque, 4);
|
||||
printf("元素 4 佇列尾入列後 deque = ");
|
||||
printArray(deque->nums, deque->queSize);
|
||||
pushFirst(deque, 1);
|
||||
printf("元素 1 佇列首入列後 deque = ");
|
||||
printArray(deque->nums, deque->queSize);
|
||||
|
||||
/* 元素出列 */
|
||||
int popLastNum = popLast(deque);
|
||||
printf("佇列尾出列元素 = %d ，佇列尾出列後 deque= ", popLastNum);
|
||||
printArray(deque->nums, deque->queSize);
|
||||
int popFirstNum = popFirst(deque);
|
||||
printf("佇列首出列元素 = %d ，佇列首出列後 deque= ", popFirstNum);
|
||||
printArray(deque->nums, deque->queSize);
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int dequeSize = size(deque);
|
||||
printf("雙向佇列長度 size = %d\r\n", dequeSize);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool isEmpty = empty(deque);
|
||||
printf("佇列是否為空 = %s\r\n", isEmpty ? "true" : "false");
|
||||
|
||||
// 釋放記憶體
|
||||
delArrayDeque(deque);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,121 @@
|
||||
/**
|
||||
* File: array_queue.c
|
||||
* Created Time: 2023-01-28
|
||||
* Author: Zero (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
/* 基於環形陣列實現的佇列 */
|
||||
typedef struct {
|
||||
int *nums; // 用於儲存佇列元素的陣列
|
||||
int front; // 佇列首指標，指向佇列首元素
|
||||
int queSize; // 尾指標，指向佇列尾 + 1
|
||||
int queCapacity; // 佇列容量
|
||||
} ArrayQueue;
|
||||
|
||||
/* 建構子 */
|
||||
ArrayQueue *newArrayQueue(int capacity) {
|
||||
ArrayQueue *queue = (ArrayQueue *)malloc(sizeof(ArrayQueue));
|
||||
// 初始化陣列
|
||||
queue->queCapacity = capacity;
|
||||
queue->nums = (int *)malloc(sizeof(int) * queue->queCapacity);
|
||||
queue->front = queue->queSize = 0;
|
||||
return queue;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delArrayQueue(ArrayQueue *queue) {
|
||||
free(queue->nums);
|
||||
free(queue);
|
||||
}
|
||||
|
||||
/* 獲取佇列的容量 */
|
||||
int capacity(ArrayQueue *queue) {
|
||||
return queue->queCapacity;
|
||||
}
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size(ArrayQueue *queue) {
|
||||
return queue->queSize;
|
||||
}
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool empty(ArrayQueue *queue) {
|
||||
return queue->queSize == 0;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peek(ArrayQueue *queue) {
|
||||
assert(size(queue) != 0);
|
||||
return queue->nums[queue->front];
|
||||
}
|
||||
|
||||
/* 入列 */
|
||||
void push(ArrayQueue *queue, int num) {
|
||||
if (size(queue) == capacity(queue)) {
|
||||
printf("佇列已滿\r\n");
|
||||
return;
|
||||
}
|
||||
// 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
// 透過取餘操作實現 rear 越過陣列尾部後回到頭部
|
||||
int rear = (queue->front + queue->queSize) % queue->queCapacity;
|
||||
// 將 num 新增至佇列尾
|
||||
queue->nums[rear] = num;
|
||||
queue->queSize++;
|
||||
}
|
||||
|
||||
/* 出列 */
|
||||
int pop(ArrayQueue *queue) {
|
||||
int num = peek(queue);
|
||||
// 佇列首指標向後移動一位，若越過尾部，則返回到陣列頭部
|
||||
queue->front = (queue->front + 1) % queue->queCapacity;
|
||||
queue->queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化佇列 */
|
||||
int capacity = 10;
|
||||
ArrayQueue *queue = newArrayQueue(capacity);
|
||||
|
||||
/* 元素入列 */
|
||||
push(queue, 1);
|
||||
push(queue, 3);
|
||||
push(queue, 2);
|
||||
push(queue, 5);
|
||||
push(queue, 4);
|
||||
printf("佇列 queue = ");
|
||||
printArray(queue->nums, queue->queSize);
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peekNum = peek(queue);
|
||||
printf("佇列首元素 peek = %d\r\n", peekNum);
|
||||
|
||||
/* 元素出列 */
|
||||
peekNum = pop(queue);
|
||||
printf("出列元素 pop = %d ，出列後 queue = ", peekNum);
|
||||
printArray(queue->nums, queue->queSize);
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int queueSize = size(queue);
|
||||
printf("佇列長度 size = %d\r\n", queueSize);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool isEmpty = empty(queue);
|
||||
printf("佇列是否為空 = %s\r\n", isEmpty ? "true" : "false");
|
||||
|
||||
/* 測試環形陣列 */
|
||||
for (int i = 0; i < 10; i++) {
|
||||
push(queue, i);
|
||||
pop(queue);
|
||||
printf("第 %d 輪入列 + 出列後 queue = ", i);
|
||||
printArray(queue->nums, queue->queSize);
|
||||
}
|
||||
|
||||
// 釋放記憶體
|
||||
delArrayQueue(queue);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,103 @@
|
||||
/**
|
||||
* File: array_stack.c
|
||||
* Created Time: 2023-01-12
|
||||
* Author: Zero (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
#define MAX_SIZE 5000
|
||||
|
||||
/* 基於陣列實現的堆疊 */
|
||||
typedef struct {
|
||||
int *data;
|
||||
int size;
|
||||
} ArrayStack;
|
||||
|
||||
/* 建構子 */
|
||||
ArrayStack *newArrayStack() {
|
||||
ArrayStack *stack = malloc(sizeof(ArrayStack));
|
||||
// 初始化一個大容量，避免擴容
|
||||
stack->data = malloc(sizeof(int) * MAX_SIZE);
|
||||
stack->size = 0;
|
||||
return stack;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delArrayStack(ArrayStack *stack) {
|
||||
free(stack->data);
|
||||
free(stack);
|
||||
}
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size(ArrayStack *stack) {
|
||||
return stack->size;
|
||||
}
|
||||
|
||||
/* 判斷堆疊是否為空 */
|
||||
bool isEmpty(ArrayStack *stack) {
|
||||
return stack->size == 0;
|
||||
}
|
||||
|
||||
/* 入堆疊 */
|
||||
void push(ArrayStack *stack, int num) {
|
||||
if (stack->size == MAX_SIZE) {
|
||||
printf("堆疊已滿\n");
|
||||
return;
|
||||
}
|
||||
stack->data[stack->size] = num;
|
||||
stack->size++;
|
||||
}
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int peek(ArrayStack *stack) {
|
||||
if (stack->size == 0) {
|
||||
printf("堆疊為空\n");
|
||||
return INT_MAX;
|
||||
}
|
||||
return stack->data[stack->size - 1];
|
||||
}
|
||||
|
||||
/* 出堆疊 */
|
||||
int pop(ArrayStack *stack) {
|
||||
int val = peek(stack);
|
||||
stack->size--;
|
||||
return val;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化堆疊 */
|
||||
ArrayStack *stack = newArrayStack();
|
||||
|
||||
/* 元素入堆疊 */
|
||||
push(stack, 1);
|
||||
push(stack, 3);
|
||||
push(stack, 2);
|
||||
push(stack, 5);
|
||||
push(stack, 4);
|
||||
printf("堆疊 stack = ");
|
||||
printArray(stack->data, stack->size);
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int val = peek(stack);
|
||||
printf("堆疊頂元素 top = %d\n", val);
|
||||
|
||||
/* 元素出堆疊 */
|
||||
val = pop(stack);
|
||||
printf("出堆疊元素 pop = %d ，出堆疊後 stack = ", val);
|
||||
printArray(stack->data, stack->size);
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size = stack->size;
|
||||
printf("堆疊的長度 size = %d\n", size);
|
||||
|
||||
/* 判斷是否為空 */
|
||||
bool empty = isEmpty(stack);
|
||||
printf("堆疊是否為空 = %stack\n", empty ? "true" : "false");
|
||||
|
||||
// 釋放記憶體
|
||||
delArrayStack(stack);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,212 @@
|
||||
/**
|
||||
* File: linkedlist_deque.c
|
||||
* Created Time: 2023-03-13
|
||||
* Author: Gonglja (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
/* 雙向鏈結串列節點 */
|
||||
typedef struct DoublyListNode {
|
||||
int val; // 節點值
|
||||
struct DoublyListNode *next; // 後繼節點
|
||||
struct DoublyListNode *prev; // 前驅節點
|
||||
} DoublyListNode;
|
||||
|
||||
/* 建構子 */
|
||||
DoublyListNode *newDoublyListNode(int num) {
|
||||
DoublyListNode *new = (DoublyListNode *)malloc(sizeof(DoublyListNode));
|
||||
new->val = num;
|
||||
new->next = NULL;
|
||||
new->prev = NULL;
|
||||
return new;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delDoublyListNode(DoublyListNode *node) {
|
||||
free(node);
|
||||
}
|
||||
|
||||
/* 基於雙向鏈結串列實現的雙向佇列 */
|
||||
typedef struct {
|
||||
DoublyListNode *front, *rear; // 頭節點 front ，尾節點 rear
|
||||
int queSize; // 雙向佇列的長度
|
||||
} LinkedListDeque;
|
||||
|
||||
/* 建構子 */
|
||||
LinkedListDeque *newLinkedListDeque() {
|
||||
LinkedListDeque *deque = (LinkedListDeque *)malloc(sizeof(LinkedListDeque));
|
||||
deque->front = NULL;
|
||||
deque->rear = NULL;
|
||||
deque->queSize = 0;
|
||||
return deque;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delLinkedListdeque(LinkedListDeque *deque) {
|
||||
// 釋放所有節點
|
||||
for (int i = 0; i < deque->queSize && deque->front != NULL; i++) {
|
||||
DoublyListNode *tmp = deque->front;
|
||||
deque->front = deque->front->next;
|
||||
free(tmp);
|
||||
}
|
||||
// 釋放 deque 結構體
|
||||
free(deque);
|
||||
}
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size(LinkedListDeque *deque) {
|
||||
return deque->queSize;
|
||||
}
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool empty(LinkedListDeque *deque) {
|
||||
return (size(deque) == 0);
|
||||
}
|
||||
|
||||
/* 入列 */
|
||||
void push(LinkedListDeque *deque, int num, bool isFront) {
|
||||
DoublyListNode *node = newDoublyListNode(num);
|
||||
// 若鏈結串列為空，則令 front 和 rear 都指向node
|
||||
if (empty(deque)) {
|
||||
deque->front = deque->rear = node;
|
||||
}
|
||||
// 佇列首入列操作
|
||||
else if (isFront) {
|
||||
// 將 node 新增至鏈結串列頭部
|
||||
deque->front->prev = node;
|
||||
node->next = deque->front;
|
||||
deque->front = node; // 更新頭節點
|
||||
}
|
||||
// 佇列尾入列操作
|
||||
else {
|
||||
// 將 node 新增至鏈結串列尾部
|
||||
deque->rear->next = node;
|
||||
node->prev = deque->rear;
|
||||
deque->rear = node;
|
||||
}
|
||||
deque->queSize++; // 更新佇列長度
|
||||
}
|
||||
|
||||
/* 佇列首入列 */
|
||||
void pushFirst(LinkedListDeque *deque, int num) {
|
||||
push(deque, num, true);
|
||||
}
|
||||
|
||||
/* 佇列尾入列 */
|
||||
void pushLast(LinkedListDeque *deque, int num) {
|
||||
push(deque, num, false);
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peekFirst(LinkedListDeque *deque) {
|
||||
assert(size(deque) && deque->front);
|
||||
return deque->front->val;
|
||||
}
|
||||
|
||||
/* 訪問佇列尾元素 */
|
||||
int peekLast(LinkedListDeque *deque) {
|
||||
assert(size(deque) && deque->rear);
|
||||
return deque->rear->val;
|
||||
}
|
||||
|
||||
/* 出列 */
|
||||
int pop(LinkedListDeque *deque, bool isFront) {
|
||||
if (empty(deque))
|
||||
return -1;
|
||||
int val;
|
||||
// 佇列首出列操作
|
||||
if (isFront) {
|
||||
val = peekFirst(deque); // 暫存頭節點值
|
||||
DoublyListNode *fNext = deque->front->next;
|
||||
if (fNext) {
|
||||
fNext->prev = NULL;
|
||||
deque->front->next = NULL;
|
||||
delDoublyListNode(deque->front);
|
||||
}
|
||||
deque->front = fNext; // 更新頭節點
|
||||
}
|
||||
// 佇列尾出列操作
|
||||
else {
|
||||
val = peekLast(deque); // 暫存尾節點值
|
||||
DoublyListNode *rPrev = deque->rear->prev;
|
||||
if (rPrev) {
|
||||
rPrev->next = NULL;
|
||||
deque->rear->prev = NULL;
|
||||
delDoublyListNode(deque->rear);
|
||||
}
|
||||
deque->rear = rPrev; // 更新尾節點
|
||||
}
|
||||
deque->queSize--; // 更新佇列長度
|
||||
return val;
|
||||
}
|
||||
|
||||
/* 佇列首出列 */
|
||||
int popFirst(LinkedListDeque *deque) {
|
||||
return pop(deque, true);
|
||||
}
|
||||
|
||||
/* 佇列尾出列 */
|
||||
int popLast(LinkedListDeque *deque) {
|
||||
return pop(deque, false);
|
||||
}
|
||||
|
||||
/* 列印佇列 */
|
||||
void printLinkedListDeque(LinkedListDeque *deque) {
|
||||
int *arr = malloc(sizeof(int) * deque->queSize);
|
||||
// 複製鏈結串列中的資料到陣列
|
||||
int i;
|
||||
DoublyListNode *node;
|
||||
for (i = 0, node = deque->front; i < deque->queSize; i++) {
|
||||
arr[i] = node->val;
|
||||
node = node->next;
|
||||
}
|
||||
printArray(arr, deque->queSize);
|
||||
free(arr);
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化雙向佇列 */
|
||||
LinkedListDeque *deque = newLinkedListDeque();
|
||||
pushLast(deque, 3);
|
||||
pushLast(deque, 2);
|
||||
pushLast(deque, 5);
|
||||
printf("雙向佇列 deque = ");
|
||||
printLinkedListDeque(deque);
|
||||
|
||||
/* 訪問元素 */
|
||||
int peekFirstNum = peekFirst(deque);
|
||||
printf("佇列首元素 peekFirst = %d\r\n", peekFirstNum);
|
||||
int peekLastNum = peekLast(deque);
|
||||
printf("佇列首元素 peekLast = %d\r\n", peekLastNum);
|
||||
|
||||
/* 元素入列 */
|
||||
pushLast(deque, 4);
|
||||
printf("元素 4 佇列尾入列後 deque =");
|
||||
printLinkedListDeque(deque);
|
||||
pushFirst(deque, 1);
|
||||
printf("元素 1 佇列首入列後 deque =");
|
||||
printLinkedListDeque(deque);
|
||||
|
||||
/* 元素出列 */
|
||||
int popLastNum = popLast(deque);
|
||||
printf("佇列尾出列元素 popLast = %d ，佇列尾出列後 deque = ", popLastNum);
|
||||
printLinkedListDeque(deque);
|
||||
int popFirstNum = popFirst(deque);
|
||||
printf("佇列首出列元素 popFirst = %d ，佇列首出列後 deque = ", popFirstNum);
|
||||
printLinkedListDeque(deque);
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int dequeSize = size(deque);
|
||||
printf("雙向佇列長度 size = %d\r\n", dequeSize);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool isEmpty = empty(deque);
|
||||
printf("雙向佇列是否為空 = %s\r\n", isEmpty ? "true" : "false");
|
||||
|
||||
// 釋放記憶體
|
||||
delLinkedListdeque(deque);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,128 @@
|
||||
/**
|
||||
* File: linkedlist_queue.c
|
||||
* Created Time: 2023-03-13
|
||||
* Author: Gonglja (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
/* 基於鏈結串列實現的佇列 */
|
||||
typedef struct {
|
||||
ListNode *front, *rear;
|
||||
int queSize;
|
||||
} LinkedListQueue;
|
||||
|
||||
/* 建構子 */
|
||||
LinkedListQueue *newLinkedListQueue() {
|
||||
LinkedListQueue *queue = (LinkedListQueue *)malloc(sizeof(LinkedListQueue));
|
||||
queue->front = NULL;
|
||||
queue->rear = NULL;
|
||||
queue->queSize = 0;
|
||||
return queue;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delLinkedListQueue(LinkedListQueue *queue) {
|
||||
// 釋放所有節點
|
||||
while (queue->front != NULL) {
|
||||
ListNode *tmp = queue->front;
|
||||
queue->front = queue->front->next;
|
||||
free(tmp);
|
||||
}
|
||||
// 釋放 queue 結構體
|
||||
free(queue);
|
||||
}
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size(LinkedListQueue *queue) {
|
||||
return queue->queSize;
|
||||
}
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool empty(LinkedListQueue *queue) {
|
||||
return (size(queue) == 0);
|
||||
}
|
||||
|
||||
/* 入列 */
|
||||
void push(LinkedListQueue *queue, int num) {
|
||||
// 尾節點處新增 node
|
||||
ListNode *node = newListNode(num);
|
||||
// 如果佇列為空，則令頭、尾節點都指向該節點
|
||||
if (queue->front == NULL) {
|
||||
queue->front = node;
|
||||
queue->rear = node;
|
||||
}
|
||||
// 如果佇列不為空，則將該節點新增到尾節點後
|
||||
else {
|
||||
queue->rear->next = node;
|
||||
queue->rear = node;
|
||||
}
|
||||
queue->queSize++;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peek(LinkedListQueue *queue) {
|
||||
assert(size(queue) && queue->front);
|
||||
return queue->front->val;
|
||||
}
|
||||
|
||||
/* 出列 */
|
||||
int pop(LinkedListQueue *queue) {
|
||||
int num = peek(queue);
|
||||
ListNode *tmp = queue->front;
|
||||
queue->front = queue->front->next;
|
||||
free(tmp);
|
||||
queue->queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 列印佇列 */
|
||||
void printLinkedListQueue(LinkedListQueue *queue) {
|
||||
int *arr = malloc(sizeof(int) * queue->queSize);
|
||||
// 複製鏈結串列中的資料到陣列
|
||||
int i;
|
||||
ListNode *node;
|
||||
for (i = 0, node = queue->front; i < queue->queSize; i++) {
|
||||
arr[i] = node->val;
|
||||
node = node->next;
|
||||
}
|
||||
printArray(arr, queue->queSize);
|
||||
free(arr);
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化佇列 */
|
||||
LinkedListQueue *queue = newLinkedListQueue();
|
||||
|
||||
/* 元素入列 */
|
||||
push(queue, 1);
|
||||
push(queue, 3);
|
||||
push(queue, 2);
|
||||
push(queue, 5);
|
||||
push(queue, 4);
|
||||
printf("佇列 queue = ");
|
||||
printLinkedListQueue(queue);
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peekNum = peek(queue);
|
||||
printf("佇列首元素 peek = %d\r\n", peekNum);
|
||||
|
||||
/* 元素出列 */
|
||||
peekNum = pop(queue);
|
||||
printf("出列元素 pop = %d ，出列後 queue = ", peekNum);
|
||||
printLinkedListQueue(queue);
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int queueSize = size(queue);
|
||||
printf("佇列長度 size = %d\r\n", queueSize);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
bool isEmpty = empty(queue);
|
||||
printf("佇列是否為空 = %s\r\n", isEmpty ? "true" : "false");
|
||||
|
||||
// 釋放記憶體
|
||||
delLinkedListQueue(queue);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,107 @@
|
||||
/**
|
||||
* File: linkedlist_stack.c
|
||||
* Created Time: 2023-01-12
|
||||
* Author: Zero (glj0@outlook.com)
|
||||
*/
|
||||
|
||||
#include "../utils/common.h"
|
||||
|
||||
/* 基於鏈結串列實現的堆疊 */
|
||||
typedef struct {
|
||||
ListNode *top; // 將頭節點作為堆疊頂
|
||||
int size; // 堆疊的長度
|
||||
} LinkedListStack;
|
||||
|
||||
/* 建構子 */
|
||||
LinkedListStack *newLinkedListStack() {
|
||||
LinkedListStack *s = malloc(sizeof(LinkedListStack));
|
||||
s->top = NULL;
|
||||
s->size = 0;
|
||||
return s;
|
||||
}
|
||||
|
||||
/* 析構函式 */
|
||||
void delLinkedListStack(LinkedListStack *s) {
|
||||
while (s->top) {
|
||||
ListNode *n = s->top->next;
|
||||
free(s->top);
|
||||
s->top = n;
|
||||
}
|
||||
free(s);
|
||||
}
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size(LinkedListStack *s) {
|
||||
return s->size;
|
||||
}
|
||||
|
||||
/* 判斷堆疊是否為空 */
|
||||
bool isEmpty(LinkedListStack *s) {
|
||||
return size(s) == 0;
|
||||
}
|
||||
|
||||
/* 入堆疊 */
|
||||
void push(LinkedListStack *s, int num) {
|
||||
ListNode *node = (ListNode *)malloc(sizeof(ListNode));
|
||||
node->next = s->top; // 更新新加節點指標域
|
||||
node->val = num; // 更新新加節點資料域
|
||||
s->top = node; // 更新堆疊頂
|
||||
s->size++; // 更新堆疊大小
|
||||
}
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int peek(LinkedListStack *s) {
|
||||
if (s->size == 0) {
|
||||
printf("堆疊為空\n");
|
||||
return INT_MAX;
|
||||
}
|
||||
return s->top->val;
|
||||
}
|
||||
|
||||
/* 出堆疊 */
|
||||
int pop(LinkedListStack *s) {
|
||||
int val = peek(s);
|
||||
ListNode *tmp = s->top;
|
||||
s->top = s->top->next;
|
||||
// 釋放記憶體
|
||||
free(tmp);
|
||||
s->size--;
|
||||
return val;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
int main() {
|
||||
/* 初始化堆疊 */
|
||||
LinkedListStack *stack = newLinkedListStack();
|
||||
|
||||
/* 元素入堆疊 */
|
||||
push(stack, 1);
|
||||
push(stack, 3);
|
||||
push(stack, 2);
|
||||
push(stack, 5);
|
||||
push(stack, 4);
|
||||
|
||||
printf("堆疊 stack = ");
|
||||
printLinkedList(stack->top);
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int val = peek(stack);
|
||||
printf("堆疊頂元素 top = %d\r\n", val);
|
||||
|
||||
/* 元素出堆疊 */
|
||||
val = pop(stack);
|
||||
printf("出堆疊元素 pop = %d, 出堆疊後 stack = ", val);
|
||||
printLinkedList(stack->top);
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
printf("堆疊的長度 size = %d\n", size(stack));
|
||||
|
||||
/* 判斷是否為空 */
|
||||
bool empty = isEmpty(stack);
|
||||
printf("堆疊是否為空 = %s\n", empty ? "true" : "false");
|
||||
|
||||
// 釋放記憶體
|
||||
delLinkedListStack(stack);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user