xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-17 17:26:06 +00: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
codes/csharp/chapter_searching/linear_search.cs
+5 -5
View File
@@ -8,7 +8,7 @@ namespace hello_algo.chapter_searching;
public class linear_search {
/* 线性查找（数组） */
static int linearSearchArray(int[] nums, int target) {
static int LinearSearchArray(int[] nums, int target) {
// 遍历数组
for (int i = 0; i < nums.Length; i++) {
// 找到目标元素，返回其索引
@@ -20,7 +20,7 @@ public class linear_search {
}
/* 线性查找（链表） */
static ListNode? linearSearchLinkedList(ListNode head, int target) {
static ListNode? LinearSearchLinkedList(ListNode? head, int target) {
// 遍历链表
while (head != null) {
// 找到目标节点，返回之
@@ -38,12 +38,12 @@ public class linear_search {
/* 在数组中执行线性查找 */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int index = linearSearchArray(nums, target);
int index = LinearSearchArray(nums, target);
Console.WriteLine("目标元素 3 的索引 = " + index);
/* 在链表中执行线性查找 */
ListNode head = ListNode.ArrToLinkedList(nums);
ListNode? node = linearSearchLinkedList(head, target);
ListNode? head = ListNode.ArrToLinkedList(nums);
ListNode? node = LinearSearchLinkedList(head, target);
Console.WriteLine("目标节点值 3 的对应节点对象为 " + node);
}
}