algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: add/refactor method in include, simplified print code (#471)

Browse Source
This commit is contained in:
hpstory
2023-04-21 14:59:22 +08:00
committed by GitHub
parent 9c2e5e2831
commit 9eeefff447
24 changed files with 102 additions and 109 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -75,7 +75,7 @@ public class array_stack
stack.push(2);
stack.push(5);
stack.push(4);
Console.WriteLine("栈 stack = " + String.Join(",", stack.toArray()));
Console.WriteLine("栈 stack = " + string.Join(",", stack.toArray()));
/* 访问栈顶元素 */
int peek = stack.peek();
@@ -83,7 +83,7 @@ public class array_stack
/* 元素出栈 */
int pop = stack.pop();
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + String.Join(",", stack.toArray()));
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.toArray()));
/* 获取栈的长度 */
int size = stack.size();

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

@@ -23,7 +23,7 @@ public class deque
deque.AddLast(4);
deque.AddFirst(3); // 添加至队首
deque.AddFirst(1);
Console.WriteLine("双向队列 deque = " + String.Join(",", deque.ToArray()));
Console.WriteLine("双向队列 deque = " + string.Join(",", deque));
/* 访问元素 */
int peekFirst = deque.First.Value; // 队首元素
@@ -33,9 +33,9 @@ public class deque
/* 元素出队 */
deque.RemoveFirst(); // 队首元素出队
Console.WriteLine("队首元素出队后 deque = " + String.Join(",", deque.ToArray()));
Console.WriteLine("队首元素出队后 deque = " + string.Join(",", deque));
deque.RemoveLast(); // 队尾元素出队
Console.WriteLine("队尾元素出队后 deque = " + String.Join(",", deque.ToArray()));
Console.WriteLine("队尾元素出队后 deque = " + string.Join(",", deque));
/* 获取双向队列的长度 */
int size = deque.Count;

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

@@ -102,7 +102,7 @@ public class linkedlist_queue
queue.push(2);
queue.push(5);
queue.push(4);
Console.WriteLine("队列 queue = " + String.Join(",", queue.toArray()));
Console.WriteLine("队列 queue = " + string.Join(",", queue.toArray()));
/* 访问队首元素 */
int peek = queue.peek();
@@ -110,7 +110,7 @@ public class linkedlist_queue
/* 元素出队 */
int pop = queue.pop();
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + String.Join(",", queue.toArray()));
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + string.Join(",", queue.toArray()));
/* 获取队列的长度 */
int size = queue.size();

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

@@ -92,7 +92,7 @@ public class linkedlist_stack
stack.push(2);
stack.push(5);
stack.push(4);
Console.WriteLine("栈 stack = " + String.Join(",", stack.toArray()));
Console.WriteLine("栈 stack = " + string.Join(",", stack.toArray()));
/* 访问栈顶元素 */
int peek = stack.peek();
@@ -100,7 +100,7 @@ public class linkedlist_stack
/* 元素出栈 */
int pop = stack.pop();
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + String.Join(",", stack.toArray()));
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.toArray()));
/* 获取栈的长度 */
int size = stack.size();

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

@@ -22,7 +22,7 @@ public class queue
queue.Enqueue(2);
queue.Enqueue(5);
queue.Enqueue(4);
Console.WriteLine("队列 queue = " + String.Join(",", queue.ToArray()));
Console.WriteLine("队列 queue = " + string.Join(",", queue));
/* 访问队首元素 */
int peek = queue.Peek();
@@ -30,7 +30,7 @@ public class queue
/* 元素出队 */
int pop = queue.Dequeue();
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + String.Join(",", queue.ToArray()));
Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + string.Join(",", queue));
/* 获取队列的长度 */
int size = queue.Count();

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

@@ -23,7 +23,7 @@ public class stack
stack.Push(5);
stack.Push(4);
// 请注意，stack.ToArray() 得到的是倒序序列，即索引 0 为栈顶
Console.WriteLine("栈 stack = " + string.Join(",", stack.ToArray()));
Console.WriteLine("栈 stack = " + string.Join(",", stack));
/* 访问栈顶元素 */
int peek = stack.Peek();
@@ -31,7 +31,7 @@ public class stack
/* 元素出栈 */
int pop = stack.Pop();
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.ToArray()));
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack));
/* 获取栈的长度 */
int size = stack.Count();