fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check
This commit is contained in:
hpstory
2023-10-08 01:33:46 +08:00
committed by GitHub
parent 6f7e768cb7
commit f62256bee1
129 changed files with 1186 additions and 1192 deletions
@@ -6,7 +6,7 @@ namespace hello_algo.chapter_array_and_linkedlist;
public class array {
/* 随机访问元素 */
public static int randomAccess(int[] nums) {
public static int RandomAccess(int[] nums) {
Random random = new();
// 在区间 [0, nums.Length) 中随机抽取一个数字
int randomIndex = random.Next(nums.Length);
@@ -16,7 +16,7 @@ public class array {
}
/* 扩展数组长度 */
public static int[] extend(int[] nums, int enlarge) {
public static int[] Extend(int[] nums, int enlarge) {
// 初始化一个扩展长度后的数组
int[] res = new int[nums.Length + enlarge];
// 将原数组中的所有元素复制到新数组
@@ -28,7 +28,7 @@ public class array {
}
/* 在数组的索引 index 处插入元素 num */
public static void insert(int[] nums, int num, int index) {
public static void Insert(int[] nums, int num, int index) {
// 把索引 index 以及之后的所有元素向后移动一位
for (int i = nums.Length - 1; i > index; i--) {
nums[i] = nums[i - 1];
@@ -38,7 +38,7 @@ public class array {
}
/* 删除索引 index 处元素 */
public static void remove(int[] nums, int index) {
public static void Remove(int[] nums, int index) {
// 把索引 index 之后的所有元素向前移动一位
for (int i = index; i < nums.Length - 1; i++) {
nums[i] = nums[i + 1];
@@ -46,7 +46,7 @@ public class array {
}
/* 遍历数组 */
public static void traverse(int[] nums) {
public static void Traverse(int[] nums) {
int count = 0;
// 通过索引遍历数组
for (int i = 0; i < nums.Length; i++) {
@@ -59,7 +59,7 @@ public class array {
}
/* 在数组中查找指定元素 */
public static int find(int[] nums, int target) {
public static int Find(int[] nums, int target) {
for (int i = 0; i < nums.Length; i++) {
if (nums[i] == target)
return i;
@@ -68,7 +68,7 @@ public class array {
}
/* 辅助函数,数组转字符串 */
public static string toString(int[] nums) {
public static string ToString(int[] nums) {
return string.Join(",", nums);
}
@@ -77,31 +77,31 @@ public class array {
public static void Test() {
// 初始化数组
int[] arr = new int[5];
Console.WriteLine("数组 arr = " + toString(arr));
Console.WriteLine("数组 arr = " + ToString(arr));
int[] nums = { 1, 3, 2, 5, 4 };
Console.WriteLine("数组 nums = " + toString(nums));
Console.WriteLine("数组 nums = " + ToString(nums));
// 随机访问
int randomNum = randomAccess(nums);
int randomNum = RandomAccess(nums);
Console.WriteLine("在 nums 中获取随机元素 " + randomNum);
// 长度扩展
nums = extend(nums, 3);
Console.WriteLine("将数组长度扩展至 8 ,得到 nums = " + toString(nums));
nums = Extend(nums, 3);
Console.WriteLine("将数组长度扩展至 8 ,得到 nums = " + ToString(nums));
// 插入元素
insert(nums, 6, 3);
Console.WriteLine("在索引 3 处插入数字 6 ,得到 nums = " + toString(nums));
Insert(nums, 6, 3);
Console.WriteLine("在索引 3 处插入数字 6 ,得到 nums = " + ToString(nums));
// 删除元素
remove(nums, 2);
Console.WriteLine("删除索引 2 处的元素,得到 nums = " + toString(nums));
Remove(nums, 2);
Console.WriteLine("删除索引 2 处的元素,得到 nums = " + ToString(nums));
// 遍历数组
traverse(nums);
Traverse(nums);
// 查找元素
int index = find(nums, 3);
int index = Find(nums, 3);
Console.WriteLine("在 nums 中查找元素 3 ,得到索引 = " + index);
}
}