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

Add build scripts for C# and

Browse Source 
unify the coding style.
This commit is contained in:
krahets
2023-02-08 22:18:02 +08:00
parent 38751cc5f5
commit 6dc21691ed
63 changed files with 2703 additions and 3911 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -6,40 +6,39 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
namespace hello_algo.chapter_stack_and_queue;
public class stack
{
public class stack
[Test]
public void Test()
{
[Test]
public void Test()
{
/* 初始化栈 */
Stack<int> stack = new();
/* 初始化栈 */
Stack<int> stack = new();
/* 元素入栈 */
stack.Push(1);
stack.Push(3);
stack.Push(2);
stack.Push(5);
stack.Push(4);
// 请注意，stack.ToArray() 得到的是倒序序列，即索引 0 为栈顶
Console.WriteLine("栈 stack = " + string.Join(",", stack.ToArray()));
/* 元素入栈 */
stack.Push(1);
stack.Push(3);
stack.Push(2);
stack.Push(5);
stack.Push(4);
// 请注意，stack.ToArray() 得到的是倒序序列，即索引 0 为栈顶
Console.WriteLine("栈 stack = " + string.Join(",", stack.ToArray()));
/* 访问栈顶元素 */
int peek = stack.Peek();
Console.WriteLine("栈顶元素 peek = " + peek);
/* 访问栈顶元素 */
int peek = stack.Peek();
Console.WriteLine("栈顶元素 peek = " + peek);
/* 元素出栈 */
int pop = stack.Pop();
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.ToArray()));
/* 元素出栈 */
int pop = stack.Pop();
Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.ToArray()));
/* 获取栈的长度 */
int size = stack.Count();
Console.WriteLine("栈的长度 size = " + size);
/* 获取栈的长度 */
int size = stack.Count();
Console.WriteLine("栈的长度 size = " + size);
/* 判断是否为空 */
bool isEmpty = stack.Count() == 0;
Console.WriteLine("栈是否为空 = " + isEmpty);
}
/* 判断是否为空 */
bool isEmpty = stack.Count() == 0;
Console.WriteLine("栈是否为空 = " + isEmpty);
}
}
}