xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-07 13:14:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-10-08 01:43:28 +08:00
parent 3d2d669b43
commit baac2d11a7
52 changed files with 999 additions and 625 deletions
Download Patch File Download Diff File Expand all files Collapse all files
zh/chapter_stack_and_queue/deque.md
+56 -56
View File
@@ -120,7 +120,7 @@ comments: true
```csharp title="deque.cs"
/* 初始化双向队列 */
// 在 C# 中，将链表 LinkedList 看作双向队列来使用
LinkedList<int> deque = new LinkedList<int>();
LinkedList<int> deque = new();
/* 元素入队 */
deque.AddLast(2); // 添加至队尾
@@ -800,20 +800,20 @@ comments: true
}
/* 获取双向队列的长度 */
public int size() {
public int Size() {
return queSize;
}
/* 判断双向队列是否为空 */
public bool isEmpty() {
return size() == 0;
public bool IsEmpty() {
return Size() == 0;
}
/* 入队操作 */
private void push(int num, bool isFront) {
ListNode node = new ListNode(num);
private void Push(int num, bool isFront) {
ListNode node = new(num);
// 若链表为空，则令 front, rear 都指向 node
if (isEmpty()) {
if (IsEmpty()) {
front = node;
rear = node;
}
@@ -836,25 +836,25 @@ comments: true
}
/* 队首入队 */
public void pushFirst(int num) {
push(num, true);
public void PushFirst(int num) {
Push(num, true);
}
/* 队尾入队 */
public void pushLast(int num) {
push(num, false);
public void PushLast(int num) {
Push(num, false);
}
/* 出队操作 */
private int? pop(bool isFront) {
if (isEmpty())
private int? Pop(bool isFront) {
if (IsEmpty())
throw new Exception();
int val;
int? val;
// 队首出队操作
if (isFront) {
val = front.val; // 暂存头节点值
val = front?.val; // 暂存头节点值
// 删除头节点
ListNode fNext = front.next;
ListNode? fNext = front?.next;
if (fNext != null) {
fNext.prev = null;
front.next = null;
@@ -863,9 +863,9 @@ comments: true
}
// 队尾出队操作
else {
val = rear.val; // 暂存尾节点值
val = rear?.val; // 暂存尾节点值
// 删除尾节点
ListNode rPrev = rear.prev;
ListNode? rPrev = rear?.prev;
if (rPrev != null) {
rPrev.next = null;
rear.prev = null;
@@ -878,36 +878,36 @@ comments: true
}
/* 队首出队 */
public int? popFirst() {
return pop(true);
public int? PopFirst() {
return Pop(true);
}
/* 队尾出队 */
public int? popLast() {
return pop(false);
public int? PopLast() {
return Pop(false);
}
/* 访问队首元素 */
public int? peekFirst() {
if (isEmpty())
public int? PeekFirst() {
if (IsEmpty())
throw new Exception();
return front.val;
return front?.val;
}
/* 访问队尾元素 */
public int? peekLast() {
if (isEmpty())
public int? PeekLast() {
if (IsEmpty())
throw new Exception();
return rear.val;
return rear?.val;
}
/* 返回数组用于打印 */
public int[] toArray() {
ListNode node = front;
int[] res = new int[size()];
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;
res[i] = node?.val;
node = node?.next;
}
return res;
@@ -2357,95 +2357,95 @@ comments: true
}
/* 获取双向队列的容量 */
public int capacity() {
public int Capacity() {
return nums.Length;
}
/* 获取双向队列的长度 */
public int size() {
public int Size() {
return queSize;
}
/* 判断双向队列是否为空 */
public bool isEmpty() {
public bool IsEmpty() {
return queSize == 0;
}
/* 计算环形数组索引 */
private int index(int i) {
private int Index(int i) {
// 通过取余操作实现数组首尾相连
// 当 i 越过数组尾部后，回到头部
// 当 i 越过数组头部后，回到尾部
return (i + capacity()) % capacity();
return (i + Capacity()) % Capacity();
}
/* 队首入队 */
public void pushFirst(int num) {
if (queSize == capacity()) {
public void PushFirst(int num) {
if (queSize == Capacity()) {
Console.WriteLine("双向队列已满");
return;
}
// 队首指针向左移动一位
// 通过取余操作，实现 front 越过数组头部后回到尾部
front = index(front - 1);
front = Index(front - 1);
// 将 num 添加至队首
nums[front] = num;
queSize++;
}
/* 队尾入队 */
public void pushLast(int num) {
if (queSize == capacity()) {
public void PushLast(int num) {
if (queSize == Capacity()) {
Console.WriteLine("双向队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
int rear = index(front + queSize);
int rear = Index(front + queSize);
// 将 num 添加至队尾
nums[rear] = num;
queSize++;
}
/* 队首出队 */
public int popFirst() {
int num = peekFirst();
public int PopFirst() {
int num = PeekFirst();
// 队首指针向后移动一位
front = index(front + 1);
front = Index(front + 1);
queSize--;
return num;
}
/* 队尾出队 */
public int popLast() {
int num = peekLast();
public int PopLast() {
int num = PeekLast();
queSize--;
return num;
}
/* 访问队首元素 */
public int peekFirst() {
if (isEmpty()) {
public int PeekFirst() {
if (IsEmpty()) {
throw new InvalidOperationException();
}
return nums[front];
}
/* 访问队尾元素 */
public int peekLast() {
if (isEmpty()) {
public int PeekLast() {
if (IsEmpty()) {
throw new InvalidOperationException();
}
// 计算尾元素索引
int last = index(front + queSize - 1);
int last = Index(front + queSize - 1);
return nums[last];
}
/* 返回数组用于打印 */
public int[] toArray() {
public int[] ToArray() {
// 仅转换有效长度范围内的列表元素
int[] res = new int[queSize];
for (int i = 0, j = front; i < queSize; i++, j++) {
res[i] = nums[index(j)];
res[i] = nums[Index(j)];
}
return res;
}
zh/chapter_stack_and_queue/queue.md
+25 -25
View File
@@ -556,19 +556,19 @@ comments: true
}
/* 获取队列的长度 */
public int size() {
public int Size() {
return queSize;
}
/* 判断队列是否为空 */
public bool isEmpty() {
return size() == 0;
public bool IsEmpty() {
return Size() == 0;
}
/* 入队 */
public void push(int num) {
public void Push(int num) {
// 尾节点后添加 num
ListNode node = new ListNode(num);
ListNode node = new(num);
// 如果队列为空，则令头、尾节点都指向该节点
if (front == null) {
front = node;
@@ -582,8 +582,8 @@ comments: true
}
/* 出队 */
public int pop() {
int num = peek();
public int Pop() {
int num = Peek();
// 删除头节点
front = front?.next;
queSize--;
@@ -591,19 +591,19 @@ comments: true
}
/* 访问队首元素 */
public int peek() {
if (isEmpty())
public int Peek() {
if (IsEmpty())
throw new Exception();
return front.val;
}
/* 将链表转化为 Array 并返回 */
public int[] toArray() {
public int[] ToArray() {
if (front == null)
return Array.Empty<int>();
ListNode node = front;
int[] res = new int[size()];
int[] res = new int[Size()];
for (int i = 0; i < res.Length; i++) {
res[i] = node.val;
node = node.next;
@@ -1446,7 +1446,7 @@ comments: true
```csharp title="array_queue.cs"
/* 基于环形数组实现的队列 */
class ArrayQueue {
private int[] nums; // 用于存储队列元素的数组
private readonly int[] nums; // 用于存储队列元素的数组
private int front; // 队首指针，指向队首元素
private int queSize; // 队列长度
@@ -1456,56 +1456,56 @@ comments: true
}
/* 获取队列的容量 */
public int capacity() {
public int Capacity() {
return nums.Length;
}
/* 获取队列的长度 */
public int size() {
public int Size() {
return queSize;
}
/* 判断队列是否为空 */
public bool isEmpty() {
public bool IsEmpty() {
return queSize == 0;
}
/* 入队 */
public void push(int num) {
if (queSize == capacity()) {
public void Push(int num) {
if (queSize == Capacity()) {
Console.WriteLine("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
int rear = (front + queSize) % capacity();
int rear = (front + queSize) % Capacity();
// 将 num 添加至队尾
nums[rear] = num;
queSize++;
}
/* 出队 */
public int pop() {
int num = peek();
public int Pop() {
int num = Peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
front = (front + 1) % capacity();
front = (front + 1) % Capacity();
queSize--;
return num;
}
/* 访问队首元素 */
public int peek() {
if (isEmpty())
public int Peek() {
if (IsEmpty())
throw new Exception();
return nums[front];
}
/* 返回数组 */
public int[] toArray() {
public int[] ToArray() {
// 仅转换有效长度范围内的列表元素
int[] res = new int[queSize];
for (int i = 0, j = front; i < queSize; i++, j++) {
res[i] = nums[j % this.capacity()];
res[i] = nums[j % this.Capacity()];
}
return res;
}
zh/chapter_stack_and_queue/stack.md
+28 -27
View File
@@ -115,7 +115,7 @@ comments: true
```csharp title="stack.cs"
/* 初始化栈 */
Stack<int> stack = new ();
Stack<int> stack = new();
/* 元素入栈 */
stack.Push(1);
@@ -526,45 +526,46 @@ comments: true
}
/* 获取栈的长度 */
public int size() {
public int Size() {
return stkSize;
}
/* 判断栈是否为空 */
public bool isEmpty() {
return size() == 0;
public bool IsEmpty() {
return Size() == 0;
}
/* 入栈 */
public void push(int num) {
ListNode node = new ListNode(num);
node.next = stackPeek;
public void Push(int num) {
ListNode node = new(num) {
next = stackPeek
};
stackPeek = node;
stkSize++;
}
/* 出栈 */
public int pop() {
int num = peek();
public int Pop() {
int num = Peek();
stackPeek = stackPeek.next;
stkSize--;
return num;
}
/* 访问栈顶元素 */
public int peek() {
if (isEmpty())
public int Peek() {
if (IsEmpty())
throw new Exception();
return stackPeek.val;
}
/* 将 List 转化为 Array 并返回 */
public int[] toArray() {
public int[] ToArray() {
if (stackPeek == null)
return Array.Empty<int>();
ListNode node = stackPeek;
int[] res = new int[size()];
int[] res = new int[Size()];
for (int i = res.Length - 1; i >= 0; i--) {
res[i] = node.val;
node = node.next;
@@ -1238,45 +1239,45 @@ comments: true
```csharp title="array_stack.cs"
/* 基于数组实现的栈 */
class ArrayStack {
private List<int> stack;
private readonly List<int> stack;
public ArrayStack() {
// 初始化列表（动态数组）
stack = new();
}
/* 获取栈的长度 */
public int size() {
return stack.Count();
public int Size() {
return stack.Count;
}
/* 判断栈是否为空 */
public bool isEmpty() {
return size() == 0;
public bool IsEmpty() {
return Size() == 0;
}
/* 入栈 */
public void push(int num) {
public void Push(int num) {
stack.Add(num);
}
/* 出栈 */
public int pop() {
if (isEmpty())
public int Pop() {
if (IsEmpty())
throw new Exception();
var val = peek();
stack.RemoveAt(size() - 1);
var val = Peek();
stack.RemoveAt(Size() - 1);
return val;
}
/* 访问栈顶元素 */
public int peek() {
if (isEmpty())
public int Peek() {
if (IsEmpty())
throw new Exception();
return stack[size() - 1];
return stack[Size() - 1];
}
/* 将 List 转化为 Array 并返回 */
public int[] toArray() {
public int[] ToArray() {
return stack.ToArray();
}
}