xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 14:36:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/chapter_searching/binary_search_insertion.cs
+3 -3
View File
@@ -8,7 +8,7 @@ namespace hello_algo.chapter_searching;
public class binary_search_insertion {
/* 二分查找插入点（无重复元素） */
public int BinarySearchInsertionSimple(int[] nums, int target) {
public static 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
@@ -44,7 +44,7 @@ public class binary_search_insertion {
[Test]
public void Test() {
// 无重复元素的数组
int[] nums = { 1, 3, 6, 8, 12, 15, 23, 26, 31, 35 };
int[] nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
Console.WriteLine("\n数组 nums = " + nums.PrintList());
// 二分查找插入点
foreach (int target in new int[] { 6, 9 }) {
@@ -53,7 +53,7 @@ public class binary_search_insertion {
}
// 包含重复元素的数组
nums = new int[] { 1, 3, 6, 6, 6, 6, 6, 10, 12, 15 };
nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
Console.WriteLine("\n数组 nums = " + nums.PrintList());
// 二分查找插入点
foreach (int target in new int[] { 2, 6, 20 }) {