xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-18 09:46:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-10-15 21:18:21 +08:00
parent eda4539790
commit e181f9b491
10 changed files with 33 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_divide_and_conquer/binary_search_recur.md
+4 -4
View File
@@ -139,7 +139,7 @@ comments: true
```csharp title="binary_search_recur.cs"
/* 二分查找：问题 f(i, j) */
int Dfs(int[] nums, int target, int i, int j) {
int DFS(int[] nums, int target, int i, int j) {
// 若区间为空，代表无目标元素，则返回 -1
if (i > j) {
return -1;
@@ -148,10 +148,10 @@ comments: true
int m = (i + j) / 2;
if (nums[m] < target) {
// 递归子问题 f(m+1, j)
return Dfs(nums, target, m + 1, j);
return DFS(nums, target, m + 1, j);
} else if (nums[m] > target) {
// 递归子问题 f(i, m-1)
return Dfs(nums, target, i, m - 1);
return DFS(nums, target, i, m - 1);
} else {
// 找到目标元素，返回其索引
return m;
@@ -162,7 +162,7 @@ comments: true
int BinarySearch(int[] nums, int target) {
int n = nums.Length;
// 求解问题 f(0, n-1)
return Dfs(nums, target, 0, n - 1);
return DFS(nums, target, 0, n - 1);
}
```