fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor: use global using to reduce usings in each file (#486)

Browse Source
This commit is contained in:
hpstory 2023-05-06 22:48:02 +08:00 committed by GitHub
parent db6caf0d43
commit 40319e7f30
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
48 changed files with 311 additions and 428 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
codes/csharp/GlobalUsing.cs Normal file
View File

@ -0,0 +1,2 @@
global using NUnit.Framework;
global using hello_algo.utils;

2
codes/csharp/chapter_array_and_linkedlist/array.cs
View File

@ -2,8 +2,6 @@
// Created Time: 2022-12-14
// Author: mingXta (1195669834@qq.com)
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist;
public class array {

3
codes/csharp/chapter_array_and_linkedlist/linked_list.cs
View File

@ -2,9 +2,6 @@
// Created Time: 2022-12-16
// Author: mingXta (1195669834@qq.com)
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist;
public class linked_list {

2
codes/csharp/chapter_array_and_linkedlist/list.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist;
public class list {

2
codes/csharp/chapter_array_and_linkedlist/my_list.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist;
/* 列表类简易实现 */

3
codes/csharp/chapter_backtracking/n_queens.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class n_queens {

3
codes/csharp/chapter_backtracking/permutations_i.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class permutations_i {

3
codes/csharp/chapter_backtracking/permutations_ii.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class permutations_ii {

3
codes/csharp/chapter_backtracking/preorder_traversal_i_compact.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class preorder_traversal_i_compact {

3
codes/csharp/chapter_backtracking/preorder_traversal_ii_compact.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class preorder_traversal_ii_compact {

3
codes/csharp/chapter_backtracking/preorder_traversal_iii_compact.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class preorder_traversal_iii_compact {

3
codes/csharp/chapter_backtracking/preorder_traversal_iii_template.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_backtracking;
public class preorder_traversal_iii_template {

2
codes/csharp/chapter_binary_search/binary_search.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_binary_search;
public class binary_search {

3
codes/csharp/chapter_computational_complexity/space_complexity.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity;
public class space_complexity {

2
codes/csharp/chapter_computational_complexity/time_complexity.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity;
public class time_complexity {

2
codes/csharp/chapter_computational_complexity/worst_best_time_complexity.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity;
public class worst_best_time_complexity {

3
codes/csharp/chapter_graph/graph_adjacency_list.cs
View File

@ -4,9 +4,6 @@
* Author: zjkung1123 (zjkung1123@gmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_graph;
/* 基于邻接表实现的无向图类 */

3
codes/csharp/chapter_graph/graph_adjacency_matrix.cs
View File

@ -4,9 +4,6 @@
* Author: zjkung1123 (zjkung1123@gmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_graph;
/* 基于邻接矩阵实现的无向图类 */

3
codes/csharp/chapter_graph/graph_bfs.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_graph;
public class graph_bfs {

3
codes/csharp/chapter_graph/graph_dfs.cs
View File

@ -4,9 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_graph;
public class graph_dfs {

2
codes/csharp/chapter_hashing/array_hash_map.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_hashing;
/* 键值对 int->string */

3
codes/csharp/chapter_hashing/hash_map.cs
View File

@ -5,9 +5,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_hashing;
public class hash_map {

3
codes/csharp/chapter_heap/heap.cs
View File

@ -4,9 +4,6 @@
* Author: zjkung1123 (zjkung1123@gmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_heap;
public class heap {

3
codes/csharp/chapter_heap/my_heap.cs
View File

@ -4,9 +4,6 @@
* Author: zjkung1123 (zjkung1123@gmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_heap;
/* 大顶堆 */

3
codes/csharp/chapter_searching/hashing_search.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_searching;
public class hashing_search {

2
codes/csharp/chapter_searching/leetcode_two_sum.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_searching;
public class leetcode_two_sum {

3
codes/csharp/chapter_searching/linear_search.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_searching;
public class linear_search {

2
codes/csharp/chapter_sorting/bubble_sort.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class bubble_sort {

2
codes/csharp/chapter_sorting/bucket_sort.cs
View File

@ -4,8 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class bucket_sort {

2
codes/csharp/chapter_sorting/counting_sort.cs
View File

@ -4,8 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class counting_sort {

2
codes/csharp/chapter_sorting/insertion_sort.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class insertion_sort {

2
codes/csharp/chapter_sorting/merge_sort.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class merge_sort {

2
codes/csharp/chapter_sorting/quick_sort.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
class QuickSort {

2
codes/csharp/chapter_sorting/radix_sort.cs
View File

@ -4,8 +4,6 @@
* Author: hpstory (hpstory1024@163.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_sorting;
public class radix_sort {

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

@ -4,151 +4,149 @@
* Author: hpstory (hpstory1024@163.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
namespace hello_algo.chapter_stack_and_queue {
/* 基于环形数组实现的双向队列 */
public class ArrayDeque {
private readonly int[] nums; // 用于存储双向队列元素的数组
private int front; // 队首指针，指向队首元素
private int queSize; // 双向队列长度
/* 基于环形数组实现的双向队列 */
public class ArrayDeque {
private readonly 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 bool isEmpty() {
return queSize == 0;
}
/* 计算环形数组索引 */
private int index(int i) {
// 通过取余操作实现数组首尾相连
// 当 i 越过数组尾部后，回到头部
// 当 i 越过数组头部后，回到尾部
return (i + capacity()) % capacity();
}
/* 队首入队 */
public void pushFirst(int num) {
if (queSize == capacity()) {
Console.WriteLine("双向队列已满");
return;
}
// 队首指针向左移动一位
// 通过取余操作，实现 front 越过数组头部后回到尾部
front = index(front - 1);
// 将 num 添加至队首
nums[front] = num;
queSize++;
}
/* 队尾入队 */
public void pushLast(int num) {
if (queSize == capacity()) {
Console.WriteLine("双向队列已满");
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 InvalidOperationException();
}
return nums[front];
}
/* 访问队尾元素 */
public int peekLast() {
if (isEmpty()) {
throw new InvalidOperationException();
}
// 计算尾元素索引
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 ArrayDeque(int capacity) {
this.nums = new int[capacity];
front = queSize = 0;
}
public class array_deque {
[Test]
public void Test() {
/* 初始化双向队列 */
ArrayDeque deque = new ArrayDeque(10);
deque.pushLast(3);
deque.pushLast(2);
deque.pushLast(5);
Console.WriteLine("双向队列 deque = " + string.Join(" ", deque.toArray()));
/* 获取双向队列的容量 */
public int capacity() {
return nums.Length;
}
/* 访问元素 */
int peekFirst = deque.peekFirst();
Console.WriteLine("队首元素 peekFirst = " + peekFirst);
int peekLast = deque.peekLast();
Console.WriteLine("队尾元素 peekLast = " + peekLast);
/* 获取双向队列的长度 */
public int size() {
return queSize;
}
/* 元素入队 */
deque.pushLast(4);
Console.WriteLine("元素 4 队尾入队后 deque = " + string.Join(" ", deque.toArray()));
deque.pushFirst(1);
Console.WriteLine("元素 1 队首入队后 deque = " + string.Join(" ", deque.toArray()));
/* 判断双向队列是否为空 */
public bool isEmpty() {
return queSize == 0;
}
/* 元素出队 */
int popLast = deque.popLast();
Console.WriteLine("队尾出队元素 = " + popLast + "，队尾出队后 deque = " + string.Join(" ", deque.toArray()));
int popFirst = deque.popFirst();
Console.WriteLine("队首出队元素 = " + popFirst + "，队首出队后 deque = " + string.Join(" ", deque.toArray()));
/* 计算环形数组索引 */
private int index(int i) {
// 通过取余操作实现数组首尾相连
// 当 i 越过数组尾部后，回到头部
// 当 i 越过数组头部后，回到尾部
return (i + capacity()) % capacity();
}
/* 获取双向队列的长度 */
int size = deque.size();
Console.WriteLine("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
bool isEmpty = deque.isEmpty();
Console.WriteLine("双向队列是否为空 = " + isEmpty);
/* 队首入队 */
public void pushFirst(int num) {
if (queSize == capacity()) {
Console.WriteLine("双向队列已满");
return;
}
// 队首指针向左移动一位
// 通过取余操作，实现 front 越过数组头部后回到尾部
front = index(front - 1);
// 将 num 添加至队首
nums[front] = num;
queSize++;
}
/* 队尾入队 */
public void pushLast(int num) {
if (queSize == capacity()) {
Console.WriteLine("双向队列已满");
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 InvalidOperationException();
}
return nums[front];
}
/* 访问队尾元素 */
public int peekLast() {
if (isEmpty()) {
throw new InvalidOperationException();
}
// 计算尾元素索引
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 {
[Test]
public void Test() {
/* 初始化双向队列 */
ArrayDeque deque = new ArrayDeque(10);
deque.pushLast(3);
deque.pushLast(2);
deque.pushLast(5);
Console.WriteLine("双向队列 deque = " + string.Join(" ", deque.toArray()));
/* 访问元素 */
int peekFirst = deque.peekFirst();
Console.WriteLine("队首元素 peekFirst = " + peekFirst);
int peekLast = deque.peekLast();
Console.WriteLine("队尾元素 peekLast = " + peekLast);
/* 元素入队 */
deque.pushLast(4);
Console.WriteLine("元素 4 队尾入队后 deque = " + string.Join(" ", deque.toArray()));
deque.pushFirst(1);
Console.WriteLine("元素 1 队首入队后 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();
Console.WriteLine("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
bool isEmpty = deque.isEmpty();
Console.WriteLine("双向队列是否为空 = " + isEmpty);
}
}

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

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
/* 基于环形数组实现的队列 */

2
codes/csharp/chapter_stack_and_queue/array_stack.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
/* 基于数组实现的栈 */

2
codes/csharp/chapter_stack_and_queue/deque.cs
View File

@ -4,8 +4,6 @@
* Author: moonache (microin1301@outlook.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
public class deque {

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

@ -4,183 +4,181 @@
* Author: hpstory (hpstory1024@163.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
namespace hello_algo.chapter_stack_and_queue {
/* 双向链表节点 */
public class ListNode {
public int val; // 节点值
public ListNode? next; // 后继节点引用（指针）
public ListNode? prev; // 前驱节点引用（指针）
/* 双向链表节点 */
public class ListNode {
public int val; // 节点值
public ListNode? next; // 后继节点引用（指针）
public ListNode? prev; // 前驱节点引用（指针）
public ListNode(int val) {
this.val = val;
prev = null;
next = null;
}
}
/* 基于双向链表实现的双向队列 */
public class LinkedListDeque {
private ListNode? front, rear; // 头节点 front, 尾节点 rear
private int queSize = 0; // 双向队列的长度
public LinkedListDeque() {
front = null;
rear = null;
}
/* 获取双向队列的长度 */
public int size() {
return queSize;
}
/* 判断双向队列是否为空 */
public bool isEmpty() {
return size() == 0;
}
/* 入队操作 */
private void push(int num, bool isFront) {
ListNode node = new ListNode(num);
// 若链表为空，则令 front, rear 都指向 node
if (isEmpty()) {
front = node;
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(bool isFront) {
// 若队列为空，直接返回 null
if (isEmpty()) {
return null;
}
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() {
return isEmpty() ? null : front.val;
}
/* 访问队尾元素 */
public int? peekLast() {
return isEmpty() ? null : 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 {
[Test]
public void Test() {
/* 初始化双向队列 */
LinkedListDeque deque = new LinkedListDeque();
deque.pushLast(3);
deque.pushLast(2);
deque.pushLast(5);
Console.WriteLine("双向队列 deque = " + string.Join(" ", deque.toArray()));
/* 访问元素 */
int? peekFirst = deque.peekFirst();
Console.WriteLine("队首元素 peekFirst = " + peekFirst);
int? peekLast = deque.peekLast();
Console.WriteLine("队尾元素 peekLast = " + peekLast);
/* 元素入队 */
deque.pushLast(4);
Console.WriteLine("元素 4 队尾入队后 deque = " + string.Join(" ", deque.toArray()));
deque.pushFirst(1);
Console.WriteLine("元素 1 队首入队后 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();
Console.WriteLine("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
bool isEmpty = deque.isEmpty();
Console.WriteLine("双向队列是否为空 = " + isEmpty);
}
public ListNode(int val) {
this.val = val;
prev = null;
next = null;
}
}
/* 基于双向链表实现的双向队列 */
public class LinkedListDeque {
private ListNode? front, rear; // 头节点 front, 尾节点 rear
private int queSize = 0; // 双向队列的长度
public LinkedListDeque() {
front = null;
rear = null;
}
/* 获取双向队列的长度 */
public int size() {
return queSize;
}
/* 判断双向队列是否为空 */
public bool isEmpty() {
return size() == 0;
}
/* 入队操作 */
private void push(int num, bool isFront) {
ListNode node = new ListNode(num);
// 若链表为空，则令 front, rear 都指向 node
if (isEmpty()) {
front = node;
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(bool isFront) {
// 若队列为空，直接返回 null
if (isEmpty()) {
return null;
}
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() {
return isEmpty() ? null : front.val;
}
/* 访问队尾元素 */
public int? peekLast() {
return isEmpty() ? null : 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 {
[Test]
public void Test() {
/* 初始化双向队列 */
LinkedListDeque deque = new LinkedListDeque();
deque.pushLast(3);
deque.pushLast(2);
deque.pushLast(5);
Console.WriteLine("双向队列 deque = " + string.Join(" ", deque.toArray()));
/* 访问元素 */
int? peekFirst = deque.peekFirst();
Console.WriteLine("队首元素 peekFirst = " + peekFirst);
int? peekLast = deque.peekLast();
Console.WriteLine("队尾元素 peekLast = " + peekLast);
/* 元素入队 */
deque.pushLast(4);
Console.WriteLine("元素 4 队尾入队后 deque = " + string.Join(" ", deque.toArray()));
deque.pushFirst(1);
Console.WriteLine("元素 1 队首入队后 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();
Console.WriteLine("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
bool isEmpty = deque.isEmpty();
Console.WriteLine("双向队列是否为空 = " + isEmpty);
}
}

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

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
/* 基于链表实现的队列 */

3
codes/csharp/chapter_stack_and_queue/linkedlist_stack.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
/* 基于链表实现的栈 */

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

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
public class queue {

2
codes/csharp/chapter_stack_and_queue/stack.cs
View File

@ -4,8 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue;
public class stack {

3
codes/csharp/chapter_tree/avl_tree.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_tree;
/* AVL 树 */

3
codes/csharp/chapter_tree/binary_search_tree.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_tree;
class BinarySearchTree {

3
codes/csharp/chapter_tree/binary_tree.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_tree;
public class binary_tree {

3
codes/csharp/chapter_tree/binary_tree_bfs.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_tree;
public class binary_tree_bfs {

3
codes/csharp/chapter_tree/binary_tree_dfs.cs
View File

@ -4,9 +4,6 @@
* Author: haptear (haptear@hotmail.com)
*/
using hello_algo.utils;
using NUnit.Framework;
namespace hello_algo.chapter_tree;
public class binary_tree_dfs {