mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-03 19:25:24 +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,151 @@
|
||||
/**
|
||||
* File: array_deque.java
|
||||
* Created Time: 2023-02-16
|
||||
* Author: krahets (krahets@163.com), FangYuan33 (374072213@qq.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
/* 基於環形陣列實現的雙向佇列 */
|
||||
class ArrayDeque {
|
||||
private int[] nums; // 用於儲存雙向佇列元素的陣列
|
||||
private int front; // 佇列首指標，指向佇列首元素
|
||||
private int queSize; // 雙向佇列長度
|
||||
|
||||
/* 建構子 */
|
||||
public ArrayDeque(int capacity) {
|
||||
this.nums = new int[capacity];
|
||||
front = queSize = 0;
|
||||
}
|
||||
|
||||
/* 獲取雙向佇列的容量 */
|
||||
public int capacity() {
|
||||
return nums.length;
|
||||
}
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
public int size() {
|
||||
return queSize;
|
||||
}
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return queSize == 0;
|
||||
}
|
||||
|
||||
/* 計算環形陣列索引 */
|
||||
private int index(int i) {
|
||||
// 透過取餘操作實現陣列首尾相連
|
||||
// 當 i 越過陣列尾部後，回到頭部
|
||||
// 當 i 越過陣列頭部後，回到尾部
|
||||
return (i + capacity()) % capacity();
|
||||
}
|
||||
|
||||
/* 佇列首入列 */
|
||||
public void pushFirst(int num) {
|
||||
if (queSize == capacity()) {
|
||||
System.out.println("雙向佇列已滿");
|
||||
return;
|
||||
}
|
||||
// 佇列首指標向左移動一位
|
||||
// 透過取餘操作實現 front 越過陣列頭部後回到尾部
|
||||
front = index(front - 1);
|
||||
// 將 num 新增至佇列首
|
||||
nums[front] = num;
|
||||
queSize++;
|
||||
}
|
||||
|
||||
/* 佇列尾入列 */
|
||||
public void pushLast(int num) {
|
||||
if (queSize == capacity()) {
|
||||
System.out.println("雙向佇列已滿");
|
||||
return;
|
||||
}
|
||||
// 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
int rear = index(front + queSize);
|
||||
// 將 num 新增至佇列尾
|
||||
nums[rear] = num;
|
||||
queSize++;
|
||||
}
|
||||
|
||||
/* 佇列首出列 */
|
||||
public int popFirst() {
|
||||
int num = peekFirst();
|
||||
// 佇列首指標向後移動一位
|
||||
front = index(front + 1);
|
||||
queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 佇列尾出列 */
|
||||
public int popLast() {
|
||||
int num = peekLast();
|
||||
queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
public int peekFirst() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return nums[front];
|
||||
}
|
||||
|
||||
/* 訪問佇列尾元素 */
|
||||
public int peekLast() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
// 計算尾元素索引
|
||||
int last = index(front + queSize - 1);
|
||||
return nums[last];
|
||||
}
|
||||
|
||||
/* 返回陣列用於列印 */
|
||||
public int[] toArray() {
|
||||
// 僅轉換有效長度範圍內的串列元素
|
||||
int[] res = new int[queSize];
|
||||
for (int i = 0, j = front; i < queSize; i++, j++) {
|
||||
res[i] = nums[index(j)];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
public class array_deque {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化雙向佇列 */
|
||||
ArrayDeque deque = new ArrayDeque(10);
|
||||
deque.pushLast(3);
|
||||
deque.pushLast(2);
|
||||
deque.pushLast(5);
|
||||
System.out.println("雙向佇列 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 訪問元素 */
|
||||
int peekFirst = deque.peekFirst();
|
||||
System.out.println("佇列首元素 peekFirst = " + peekFirst);
|
||||
int peekLast = deque.peekLast();
|
||||
System.out.println("佇列尾元素 peekLast = " + peekLast);
|
||||
|
||||
/* 元素入列 */
|
||||
deque.pushLast(4);
|
||||
System.out.println("元素 4 佇列尾入列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
deque.pushFirst(1);
|
||||
System.out.println("元素 1 佇列首入列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 元素出列 */
|
||||
int popLast = deque.popLast();
|
||||
System.out.println("佇列尾出列元素 = " + popLast + "，佇列尾出列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
int popFirst = deque.popFirst();
|
||||
System.out.println("佇列首出列元素 = " + popFirst + "，佇列首出列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
int size = deque.size();
|
||||
System.out.println("雙向佇列長度 size = " + size);
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
boolean isEmpty = deque.isEmpty();
|
||||
System.out.println("雙向佇列是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,115 @@
|
||||
/**
|
||||
* File: array_queue.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
/* 基於環形陣列實現的佇列 */
|
||||
class ArrayQueue {
|
||||
private int[] nums; // 用於儲存佇列元素的陣列
|
||||
private int front; // 佇列首指標，指向佇列首元素
|
||||
private int queSize; // 佇列長度
|
||||
|
||||
public ArrayQueue(int capacity) {
|
||||
nums = new int[capacity];
|
||||
front = queSize = 0;
|
||||
}
|
||||
|
||||
/* 獲取佇列的容量 */
|
||||
public int capacity() {
|
||||
return nums.length;
|
||||
}
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
public int size() {
|
||||
return queSize;
|
||||
}
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return queSize == 0;
|
||||
}
|
||||
|
||||
/* 入列 */
|
||||
public void push(int num) {
|
||||
if (queSize == capacity()) {
|
||||
System.out.println("佇列已滿");
|
||||
return;
|
||||
}
|
||||
// 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
// 透過取餘操作實現 rear 越過陣列尾部後回到頭部
|
||||
int rear = (front + queSize) % capacity();
|
||||
// 將 num 新增至佇列尾
|
||||
nums[rear] = num;
|
||||
queSize++;
|
||||
}
|
||||
|
||||
/* 出列 */
|
||||
public int pop() {
|
||||
int num = peek();
|
||||
// 佇列首指標向後移動一位，若越過尾部，則返回到陣列頭部
|
||||
front = (front + 1) % capacity();
|
||||
queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
public int peek() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return nums[front];
|
||||
}
|
||||
|
||||
/* 返回陣列 */
|
||||
public int[] toArray() {
|
||||
// 僅轉換有效長度範圍內的串列元素
|
||||
int[] res = new int[queSize];
|
||||
for (int i = 0, j = front; i < queSize; i++, j++) {
|
||||
res[i] = nums[j % capacity()];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
public class array_queue {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化佇列 */
|
||||
int capacity = 10;
|
||||
ArrayQueue queue = new ArrayQueue(capacity);
|
||||
|
||||
/* 元素入列 */
|
||||
queue.push(1);
|
||||
queue.push(3);
|
||||
queue.push(2);
|
||||
queue.push(5);
|
||||
queue.push(4);
|
||||
System.out.println("佇列 queue = " + Arrays.toString(queue.toArray()));
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peek = queue.peek();
|
||||
System.out.println("佇列首元素 peek = " + peek);
|
||||
|
||||
/* 元素出列 */
|
||||
int pop = queue.pop();
|
||||
System.out.println("出列元素 pop = " + pop + "，出列後 queue = " + Arrays.toString(queue.toArray()));
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size = queue.size();
|
||||
System.out.println("佇列長度 size = " + size);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
boolean isEmpty = queue.isEmpty();
|
||||
System.out.println("佇列是否為空 = " + isEmpty);
|
||||
|
||||
/* 測試環形陣列 */
|
||||
for (int i = 0; i < 10; i++) {
|
||||
queue.push(i);
|
||||
queue.pop();
|
||||
System.out.println("第 " + i + " 輪入列 + 出列後 queue = " + Arrays.toString(queue.toArray()));
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,84 @@
|
||||
/**
|
||||
* File: array_stack.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
/* 基於陣列實現的堆疊 */
|
||||
class ArrayStack {
|
||||
private ArrayList<Integer> stack;
|
||||
|
||||
public ArrayStack() {
|
||||
// 初始化串列（動態陣列）
|
||||
stack = new ArrayList<>();
|
||||
}
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
public int size() {
|
||||
return stack.size();
|
||||
}
|
||||
|
||||
/* 判斷堆疊是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return size() == 0;
|
||||
}
|
||||
|
||||
/* 入堆疊 */
|
||||
public void push(int num) {
|
||||
stack.add(num);
|
||||
}
|
||||
|
||||
/* 出堆疊 */
|
||||
public int pop() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return stack.remove(size() - 1);
|
||||
}
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
public int peek() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return stack.get(size() - 1);
|
||||
}
|
||||
|
||||
/* 將 List 轉化為 Array 並返回 */
|
||||
public Object[] toArray() {
|
||||
return stack.toArray();
|
||||
}
|
||||
}
|
||||
|
||||
public class array_stack {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化堆疊 */
|
||||
ArrayStack stack = new ArrayStack();
|
||||
|
||||
/* 元素入堆疊 */
|
||||
stack.push(1);
|
||||
stack.push(3);
|
||||
stack.push(2);
|
||||
stack.push(5);
|
||||
stack.push(4);
|
||||
System.out.println("堆疊 stack = " + Arrays.toString(stack.toArray()));
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int peek = stack.peek();
|
||||
System.out.println("堆疊頂元素 peek = " + peek);
|
||||
|
||||
/* 元素出堆疊 */
|
||||
int pop = stack.pop();
|
||||
System.out.println("出堆疊元素 pop = " + pop + "，出堆疊後 stack = " + Arrays.toString(stack.toArray()));
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size = stack.size();
|
||||
System.out.println("堆疊的長度 size = " + size);
|
||||
|
||||
/* 判斷是否為空 */
|
||||
boolean isEmpty = stack.isEmpty();
|
||||
System.out.println("堆疊是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,46 @@
|
||||
/**
|
||||
* File: deque.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class deque {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化雙向佇列 */
|
||||
Deque<Integer> deque = new LinkedList<>();
|
||||
deque.offerLast(3);
|
||||
deque.offerLast(2);
|
||||
deque.offerLast(5);
|
||||
System.out.println("雙向佇列 deque = " + deque);
|
||||
|
||||
/* 訪問元素 */
|
||||
int peekFirst = deque.peekFirst();
|
||||
System.out.println("佇列首元素 peekFirst = " + peekFirst);
|
||||
int peekLast = deque.peekLast();
|
||||
System.out.println("佇列尾元素 peekLast = " + peekLast);
|
||||
|
||||
/* 元素入列 */
|
||||
deque.offerLast(4);
|
||||
System.out.println("元素 4 佇列尾入列後 deque = " + deque);
|
||||
deque.offerFirst(1);
|
||||
System.out.println("元素 1 佇列首入列後 deque = " + deque);
|
||||
|
||||
/* 元素出列 */
|
||||
int popLast = deque.pollLast();
|
||||
System.out.println("佇列尾出列元素 = " + popLast + "，佇列尾出列後 deque = " + deque);
|
||||
int popFirst = deque.pollFirst();
|
||||
System.out.println("佇列首出列元素 = " + popFirst + "，佇列首出列後 deque = " + deque);
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
int size = deque.size();
|
||||
System.out.println("雙向佇列長度 size = " + size);
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
boolean isEmpty = deque.isEmpty();
|
||||
System.out.println("雙向佇列是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,175 @@
|
||||
/**
|
||||
* File: linkedlist_deque.java
|
||||
* Created Time: 2023-01-20
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
/* 雙向鏈結串列節點 */
|
||||
class ListNode {
|
||||
int val; // 節點值
|
||||
ListNode next; // 後繼節點引用
|
||||
ListNode prev; // 前驅節點引用
|
||||
|
||||
ListNode(int val) {
|
||||
this.val = val;
|
||||
prev = next = null;
|
||||
}
|
||||
}
|
||||
|
||||
/* 基於雙向鏈結串列實現的雙向佇列 */
|
||||
class LinkedListDeque {
|
||||
private ListNode front, rear; // 頭節點 front ，尾節點 rear
|
||||
private int queSize = 0; // 雙向佇列的長度
|
||||
|
||||
public LinkedListDeque() {
|
||||
front = rear = null;
|
||||
}
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
public int size() {
|
||||
return queSize;
|
||||
}
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return size() == 0;
|
||||
}
|
||||
|
||||
/* 入列操作 */
|
||||
private void push(int num, boolean isFront) {
|
||||
ListNode node = new ListNode(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++; // 更新佇列長度
|
||||
}
|
||||
|
||||
/* 佇列首入列 */
|
||||
public void pushFirst(int num) {
|
||||
push(num, true);
|
||||
}
|
||||
|
||||
/* 佇列尾入列 */
|
||||
public void pushLast(int num) {
|
||||
push(num, false);
|
||||
}
|
||||
|
||||
/* 出列操作 */
|
||||
private int pop(boolean isFront) {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
int val;
|
||||
// 佇列首出列操作
|
||||
if (isFront) {
|
||||
val = front.val; // 暫存頭節點值
|
||||
// 刪除頭節點
|
||||
ListNode fNext = front.next;
|
||||
if (fNext != null) {
|
||||
fNext.prev = null;
|
||||
front.next = null;
|
||||
}
|
||||
front = fNext; // 更新頭節點
|
||||
// 佇列尾出列操作
|
||||
} else {
|
||||
val = rear.val; // 暫存尾節點值
|
||||
// 刪除尾節點
|
||||
ListNode rPrev = rear.prev;
|
||||
if (rPrev != null) {
|
||||
rPrev.next = null;
|
||||
rear.prev = null;
|
||||
}
|
||||
rear = rPrev; // 更新尾節點
|
||||
}
|
||||
queSize--; // 更新佇列長度
|
||||
return val;
|
||||
}
|
||||
|
||||
/* 佇列首出列 */
|
||||
public int popFirst() {
|
||||
return pop(true);
|
||||
}
|
||||
|
||||
/* 佇列尾出列 */
|
||||
public int popLast() {
|
||||
return pop(false);
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
public int peekFirst() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return front.val;
|
||||
}
|
||||
|
||||
/* 訪問佇列尾元素 */
|
||||
public int peekLast() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return rear.val;
|
||||
}
|
||||
|
||||
/* 返回陣列用於列印 */
|
||||
public int[] toArray() {
|
||||
ListNode node = front;
|
||||
int[] res = new int[size()];
|
||||
for (int i = 0; i < res.length; i++) {
|
||||
res[i] = node.val;
|
||||
node = node.next;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
public class linkedlist_deque {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化雙向佇列 */
|
||||
LinkedListDeque deque = new LinkedListDeque();
|
||||
deque.pushLast(3);
|
||||
deque.pushLast(2);
|
||||
deque.pushLast(5);
|
||||
System.out.println("雙向佇列 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 訪問元素 */
|
||||
int peekFirst = deque.peekFirst();
|
||||
System.out.println("佇列首元素 peekFirst = " + peekFirst);
|
||||
int peekLast = deque.peekLast();
|
||||
System.out.println("佇列尾元素 peekLast = " + peekLast);
|
||||
|
||||
/* 元素入列 */
|
||||
deque.pushLast(4);
|
||||
System.out.println("元素 4 佇列尾入列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
deque.pushFirst(1);
|
||||
System.out.println("元素 1 佇列首入列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 元素出列 */
|
||||
int popLast = deque.popLast();
|
||||
System.out.println("佇列尾出列元素 = " + popLast + "，佇列尾出列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
int popFirst = deque.popFirst();
|
||||
System.out.println("佇列首出列元素 = " + popFirst + "，佇列首出列後 deque = " + Arrays.toString(deque.toArray()));
|
||||
|
||||
/* 獲取雙向佇列的長度 */
|
||||
int size = deque.size();
|
||||
System.out.println("雙向佇列長度 size = " + size);
|
||||
|
||||
/* 判斷雙向佇列是否為空 */
|
||||
boolean isEmpty = deque.isEmpty();
|
||||
System.out.println("雙向佇列是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,104 @@
|
||||
/**
|
||||
* File: linkedlist_queue.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
/* 基於鏈結串列實現的佇列 */
|
||||
class LinkedListQueue {
|
||||
private ListNode front, rear; // 頭節點 front ，尾節點 rear
|
||||
private int queSize = 0;
|
||||
|
||||
public LinkedListQueue() {
|
||||
front = null;
|
||||
rear = null;
|
||||
}
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
public int size() {
|
||||
return queSize;
|
||||
}
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return size() == 0;
|
||||
}
|
||||
|
||||
/* 入列 */
|
||||
public void push(int num) {
|
||||
// 在尾節點後新增 num
|
||||
ListNode node = new ListNode(num);
|
||||
// 如果佇列為空，則令頭、尾節點都指向該節點
|
||||
if (front == null) {
|
||||
front = node;
|
||||
rear = node;
|
||||
// 如果佇列不為空，則將該節點新增到尾節點後
|
||||
} else {
|
||||
rear.next = node;
|
||||
rear = node;
|
||||
}
|
||||
queSize++;
|
||||
}
|
||||
|
||||
/* 出列 */
|
||||
public int pop() {
|
||||
int num = peek();
|
||||
// 刪除頭節點
|
||||
front = front.next;
|
||||
queSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
public int peek() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return front.val;
|
||||
}
|
||||
|
||||
/* 將鏈結串列轉化為 Array 並返回 */
|
||||
public int[] toArray() {
|
||||
ListNode node = front;
|
||||
int[] res = new int[size()];
|
||||
for (int i = 0; i < res.length; i++) {
|
||||
res[i] = node.val;
|
||||
node = node.next;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
public class linkedlist_queue {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化佇列 */
|
||||
LinkedListQueue queue = new LinkedListQueue();
|
||||
|
||||
/* 元素入列 */
|
||||
queue.push(1);
|
||||
queue.push(3);
|
||||
queue.push(2);
|
||||
queue.push(5);
|
||||
queue.push(4);
|
||||
System.out.println("佇列 queue = " + Arrays.toString(queue.toArray()));
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peek = queue.peek();
|
||||
System.out.println("佇列首元素 peek = " + peek);
|
||||
|
||||
/* 元素出列 */
|
||||
int pop = queue.pop();
|
||||
System.out.println("出列元素 pop = " + pop + "，出列後 queue = " + Arrays.toString(queue.toArray()));
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size = queue.size();
|
||||
System.out.println("佇列長度 size = " + size);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
boolean isEmpty = queue.isEmpty();
|
||||
System.out.println("佇列是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,95 @@
|
||||
/**
|
||||
* File: linkedlist_stack.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
import utils.*;
|
||||
|
||||
/* 基於鏈結串列實現的堆疊 */
|
||||
class LinkedListStack {
|
||||
private ListNode stackPeek; // 將頭節點作為堆疊頂
|
||||
private int stkSize = 0; // 堆疊的長度
|
||||
|
||||
public LinkedListStack() {
|
||||
stackPeek = null;
|
||||
}
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
public int size() {
|
||||
return stkSize;
|
||||
}
|
||||
|
||||
/* 判斷堆疊是否為空 */
|
||||
public boolean isEmpty() {
|
||||
return size() == 0;
|
||||
}
|
||||
|
||||
/* 入堆疊 */
|
||||
public void push(int num) {
|
||||
ListNode node = new ListNode(num);
|
||||
node.next = stackPeek;
|
||||
stackPeek = node;
|
||||
stkSize++;
|
||||
}
|
||||
|
||||
/* 出堆疊 */
|
||||
public int pop() {
|
||||
int num = peek();
|
||||
stackPeek = stackPeek.next;
|
||||
stkSize--;
|
||||
return num;
|
||||
}
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
public int peek() {
|
||||
if (isEmpty())
|
||||
throw new IndexOutOfBoundsException();
|
||||
return stackPeek.val;
|
||||
}
|
||||
|
||||
/* 將 List 轉化為 Array 並返回 */
|
||||
public int[] toArray() {
|
||||
ListNode node = stackPeek;
|
||||
int[] res = new int[size()];
|
||||
for (int i = res.length - 1; i >= 0; i--) {
|
||||
res[i] = node.val;
|
||||
node = node.next;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
public class linkedlist_stack {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化堆疊 */
|
||||
LinkedListStack stack = new LinkedListStack();
|
||||
|
||||
/* 元素入堆疊 */
|
||||
stack.push(1);
|
||||
stack.push(3);
|
||||
stack.push(2);
|
||||
stack.push(5);
|
||||
stack.push(4);
|
||||
System.out.println("堆疊 stack = " + Arrays.toString(stack.toArray()));
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int peek = stack.peek();
|
||||
System.out.println("堆疊頂元素 peek = " + peek);
|
||||
|
||||
/* 元素出堆疊 */
|
||||
int pop = stack.pop();
|
||||
System.out.println("出堆疊元素 pop = " + pop + "，出堆疊後 stack = " + Arrays.toString(stack.toArray()));
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size = stack.size();
|
||||
System.out.println("堆疊的長度 size = " + size);
|
||||
|
||||
/* 判斷是否為空 */
|
||||
boolean isEmpty = stack.isEmpty();
|
||||
System.out.println("堆疊是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,40 @@
|
||||
/**
|
||||
* File: queue.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class queue {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化佇列 */
|
||||
Queue<Integer> queue = new LinkedList<>();
|
||||
|
||||
/* 元素入列 */
|
||||
queue.offer(1);
|
||||
queue.offer(3);
|
||||
queue.offer(2);
|
||||
queue.offer(5);
|
||||
queue.offer(4);
|
||||
System.out.println("佇列 queue = " + queue);
|
||||
|
||||
/* 訪問佇列首元素 */
|
||||
int peek = queue.peek();
|
||||
System.out.println("佇列首元素 peek = " + peek);
|
||||
|
||||
/* 元素出列 */
|
||||
int pop = queue.poll();
|
||||
System.out.println("出列元素 pop = " + pop + "，出列後 queue = " + queue);
|
||||
|
||||
/* 獲取佇列的長度 */
|
||||
int size = queue.size();
|
||||
System.out.println("佇列長度 size = " + size);
|
||||
|
||||
/* 判斷佇列是否為空 */
|
||||
boolean isEmpty = queue.isEmpty();
|
||||
System.out.println("佇列是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,40 @@
|
||||
/**
|
||||
* File: stack.java
|
||||
* Created Time: 2022-11-25
|
||||
* Author: krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
package chapter_stack_and_queue;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class stack {
|
||||
public static void main(String[] args) {
|
||||
/* 初始化堆疊 */
|
||||
Stack<Integer> stack = new Stack<>();
|
||||
|
||||
/* 元素入堆疊 */
|
||||
stack.push(1);
|
||||
stack.push(3);
|
||||
stack.push(2);
|
||||
stack.push(5);
|
||||
stack.push(4);
|
||||
System.out.println("堆疊 stack = " + stack);
|
||||
|
||||
/* 訪問堆疊頂元素 */
|
||||
int peek = stack.peek();
|
||||
System.out.println("堆疊頂元素 peek = " + peek);
|
||||
|
||||
/* 元素出堆疊 */
|
||||
int pop = stack.pop();
|
||||
System.out.println("出堆疊元素 pop = " + pop + "，出堆疊後 stack = " + stack);
|
||||
|
||||
/* 獲取堆疊的長度 */
|
||||
int size = stack.size();
|
||||
System.out.println("堆疊的長度 size = " + size);
|
||||
|
||||
/* 判斷是否為空 */
|
||||
boolean isEmpty = stack.isEmpty();
|
||||
System.out.println("堆疊是否為空 = " + isEmpty);
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user