algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
* 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
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/csharp/chapter_searching/binary_search_insertion.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_searching;
public class binary_search_insertion {
/* 二分查找插入点（无重复元素） */
public int binarySearchInsertionSimple(int[] nums, int target) {
public int BinarySearchInsertionSimple(int[] nums, int target) {
int i = 0, j = nums.Length - 1; // 初始化双闭区间 [0, n-1]
while (i <= j) {
int m = i + (j - i) / 2; // 计算中点索引 m
@@ -25,7 +25,7 @@ public class binary_search_insertion {
}
/* 二分查找插入点（存在重复元素） */
public static int binarySearchInsertion(int[] nums, int target) {
public static int BinarySearchInsertion(int[] nums, int target) {
int i = 0, j = nums.Length - 1; // 初始化双闭区间 [0, n-1]
while (i <= j) {
int m = i + (j - i) / 2; // 计算中点索引 m
@@ -48,7 +48,7 @@ public class binary_search_insertion {
Console.WriteLine("\n数组 nums = " + nums.PrintList());
// 二分查找插入点
foreach (int target in new int[] { 6, 9 }) {
int index = binarySearchInsertionSimple(nums, target);
int index = BinarySearchInsertionSimple(nums, target);
Console.WriteLine("元素 " + target + " 的插入点的索引为 " + index);
}
@@ -57,7 +57,7 @@ public class binary_search_insertion {
Console.WriteLine("\n数组 nums = " + nums.PrintList());
// 二分查找插入点
foreach (int target in new int[] { 2, 6, 20 }) {
int index = binarySearchInsertion(nums, target);
int index = BinarySearchInsertion(nums, target);
Console.WriteLine("元素 " + target + " 的插入点的索引为 " + index);
}
}