algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 21:24:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace poll with pop in Queue and Deque (#415)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-13 21:58:21 +08:00
committed by GitHub
parent 2d17ee8e92
commit 8aebbaad21
77 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/csharp/chapter_stack_and_queue/array_deque.cs
View File

@ -81,7 +81,7 @@ namespace hello_algo.chapter_stack_and_queue
}
/* 队首出队 */
public int pollFirst()
public int popFirst()
{
int num = peekFirst();
// 队首指针向后移动一位
@ -91,7 +91,7 @@ namespace hello_algo.chapter_stack_and_queue
}
/* 队尾出队 */
public int pollLast()
public int popLast()
{
int num = peekLast();
queSize--;
@ -158,10 +158,10 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("元素 1 队首入队后 deque = " + string.Join(" ", deque.toArray()));
/* 元素出队 */
int pollLast = deque.pollLast();
Console.WriteLine("队尾出队元素 = " + pollLast + "，队尾出队后 deque = " + string.Join(" ", deque.toArray()));
int pollFirst = deque.pollFirst();
Console.WriteLine("队首出队元素 = " + pollFirst + "，队首出队后 deque = " + string.Join(" ", deque.toArray()));
int popLast = deque.popLast();
Console.WriteLine("队尾出队元素 = " + popLast + "，队尾出队后 deque = " + string.Join(" ", deque.toArray()));
int popFirst = deque.popFirst();
Console.WriteLine("队首出队元素 = " + popFirst + "，队首出队后 deque = " + string.Join(" ", deque.toArray()));
/* 获取双向队列的长度 */
int size = deque.size();

8
codes/csharp/chapter_stack_and_queue/array_queue.cs
View File

@ -56,7 +56,7 @@ class ArrayQueue
}
/* 出队 */
public int poll()
public int pop()
{
int num = peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
@ -108,8 +108,8 @@ public class array_queue
Console.WriteLine("队首元素 peek = " + peek);
/* 元素出队 */
int poll = queue.poll();
Console.WriteLine("出队元素 poll = " + poll + "，出队后 queue = " + string.Join(",", queue.toArray()));
int pop = queue.pop();
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + string.Join(",", queue.toArray()));
/* 获取队列的长度 */
int size = queue.size();
@ -123,7 +123,7 @@ public class array_queue
for (int i = 0; i < 10; i++)
{
queue.push(i);
queue.poll();
queue.pop();
Console.WriteLine("第 " + i + " 轮入队 + 出队后 queue = " + string.Join(",", queue.toArray()));
}
}

18
codes/csharp/chapter_stack_and_queue/linkedlist_deque.cs
View File

@ -90,7 +90,7 @@ namespace hello_algo.chapter_stack_and_queue
}
/* 出队操作 */
private int? poll(bool isFront)
private int? pop(bool isFront)
{
// 若队列为空，直接返回 null
if (isEmpty())
@ -133,15 +133,15 @@ namespace hello_algo.chapter_stack_and_queue
}
/* 队首出队 */
public int? pollFirst()
public int? popFirst()
{
return poll(true);
return pop(true);
}
/* 队尾出队 */
public int? pollLast()
public int? popLast()
{
return poll(false);
return pop(false);
}
/* 访问队首元素 */
@ -196,10 +196,10 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("元素 1 队首入队后 deque = " + string.Join(" ", deque.toArray()));
/* 元素出队 */
int? pollLast = deque.pollLast();
Console.WriteLine("队尾出队元素 = " + pollLast + "，队尾出队后 deque = " + string.Join(" ", deque.toArray()));
int? pollFirst = deque.pollFirst();
Console.WriteLine("队首出队元素 = " + pollFirst + "，队首出队后 deque = " + string.Join(" ", deque.toArray()));
int? popLast = deque.popLast();
Console.WriteLine("队尾出队元素 = " + popLast + "，队尾出队后 deque = " + string.Join(" ", deque.toArray()));
int? popFirst = deque.popFirst();
Console.WriteLine("队首出队元素 = " + popFirst + "，队首出队后 deque = " + string.Join(" ", deque.toArray()));
/* 获取双向队列的长度 */
int size = deque.size();

6
codes/csharp/chapter_stack_and_queue/linkedlist_queue.cs
View File

@ -54,7 +54,7 @@ class LinkedListQueue
}
/* 出队 */
public int poll()
public int pop()
{
int num = peek();
// 删除头结点
@ -109,8 +109,8 @@ public class linkedlist_queue
Console.WriteLine("队首元素 peek = " + peek);
/* 元素出队 */
int poll = queue.poll();
Console.WriteLine("出队元素 poll = " + poll + "，出队后 queue = " + String.Join(",", queue.toArray()));
int pop = queue.pop();
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + String.Join(",", queue.toArray()));
/* 获取队列的长度 */
int size = queue.size();

4
codes/csharp/chapter_stack_and_queue/queue.cs
View File

@ -29,8 +29,8 @@ public class queue
Console.WriteLine("队首元素 peek = " + peek);
/* 元素出队 */
int poll = queue.Dequeue();
Console.WriteLine("出队元素 poll = " + poll + "，出队后 queue = " + String.Join(",", queue.ToArray()));
int pop = queue.Dequeue();
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + String.Join(",", queue.ToArray()));
/* 获取队列的长度 */
int size = queue.Count();