xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 00:36:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Modify some formats.

Browse source
This commit is contained in:
ming 2022-12-16 16:57:16 +08:00 committed by Ming
parent 0a0374efa0
commit 49756d8c7e
4 changed files with 36 additions and 22 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
codes/csharp/chapter_array_and_linkedlist/Array.cs
View file

@ -6,7 +6,9 @@ namespace hello_algo.chapter_array_and_linkedlist
{ {
public class Array public class Array
{ {
//随机返回一个数组元素 /// <summary>
/// 随机返回一个数组元素
/// </summary>
public static int RandomAccess(int[] nums) public static int RandomAccess(int[] nums)
{ {
Random random = new(); Random random = new();
@ -15,7 +17,9 @@ namespace hello_algo.chapter_array_and_linkedlist
return randomNum; return randomNum;
} }
//扩展数组长度 /// <summary>
/// 扩展数组长度
/// </summary>
public static int[] Extend(int[] nums, int enlarge) public static int[] Extend(int[] nums, int enlarge)
{ {
// 初始化一个扩展长度后的数组 // 初始化一个扩展长度后的数组
@ -29,7 +33,9 @@ namespace hello_algo.chapter_array_and_linkedlist
return res; return res;
} }
//在数组的索引 index 处插入元素 num /// <summary>
/// 在数组的索引 index 处插入元素 num
/// </summary>
public static void Insert(int[] nums, int num, int index) public static void Insert(int[] nums, int num, int index)
{ {
// 把索引 index 以及之后的所有元素向后移动一位 // 把索引 index 以及之后的所有元素向后移动一位
@ -41,7 +47,9 @@ namespace hello_algo.chapter_array_and_linkedlist
nums[index] = num; nums[index] = num;
} }
//删除索引 index 处元素 /// <summary>
/// 删除索引 index 处元素
/// </summary>
public static void Remove(int[] nums, int index) public static void Remove(int[] nums, int index)
{ {
// 把索引 index 之后的所有元素向前移动一位 // 把索引 index 之后的所有元素向前移动一位
@ -51,7 +59,9 @@ namespace hello_algo.chapter_array_and_linkedlist
} }
} }
//遍历数组 /// <summary>
/// 遍历数组
/// </summary>
public static void Traverse(int[] nums) public static void Traverse(int[] nums)
{ {
int count = 0; int count = 0;
@ -67,7 +77,9 @@ namespace hello_algo.chapter_array_and_linkedlist
} }
} }
//在数组中查找指定元素 /// <summary>
/// 在数组中查找指定元素
/// </summary>
public static int Find(int[] nums, int target) public static int Find(int[] nums, int target)
{ {
for (int i = 0; i < nums.Length; i++) for (int i = 0; i < nums.Length; i++)
@ -78,7 +90,9 @@ namespace hello_algo.chapter_array_and_linkedlist
return -1; return -1;
} }
//辅助函数,数组转字符串 /// <summary>
/// 辅助函数,数组转字符串
/// </summary>
public static string ToString(int[] nums) public static string ToString(int[] nums)
{ {
return string.Join(",", nums); return string.Join(",", nums);

2
codes/csharp/test/chapter_array_and_linkedlist/ArrayTest.cs
View file

@ -5,7 +5,7 @@
using NUnit.Framework; using NUnit.Framework;
using Array = hello_algo.chapter_array_and_linkedlist.Array; using Array = hello_algo.chapter_array_and_linkedlist.Array;
namespace hello_algo.Test.chapter_array_and_linkedlist namespace hello_algo.test.chapter_array_and_linkedlist
{ {
[TestFixture] [TestFixture]
internal class ArrayTest internal class ArrayTest

2
codes/csharp/test/chapter_array_and_linkedlist/LinkedListTest.cs
View file

@ -6,7 +6,7 @@ using hello_algo.chapter_array_and_linkedlist;
using hello_algo.include; using hello_algo.include;
using NUnit.Framework; using NUnit.Framework;
namespace hello_algo.Test.chapter_array_and_linkedlist namespace hello_algo.test.chapter_array_and_linkedlist
{ {
[TestFixture] [TestFixture]
internal class LinkedListTest internal class LinkedListTest