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

build

Browse Source
This commit is contained in:
krahets
2023-10-08 01:43:28 +08:00
parent 3d2d669b43
commit baac2d11a7
52 changed files with 999 additions and 625 deletions
Download Patch File Download Diff File Expand all files Collapse all files
zh/chapter_divide_and_conquer/binary_search_recur.md
+30 -7
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;
@@ -159,10 +159,10 @@ comments: true
}
/* 二分查找 */
int binarySearch(int[] nums, int target) {
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);
}
```
@@ -354,9 +354,32 @@ comments: true
=== "C"
```c title="binary_search_recur.c"
[class]{}-[func]{dfs}
/* 二分查找：问题 f(i, j) */
int dfs(int nums[], int target, int i, int j) {
// 若区间为空，代表无目标元素，则返回 -1
if (i > j) {
return -1;
}
// 计算中点索引 m
int m = (i + j) / 2;
if (nums[m] < target) {
// 递归子问题 f(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);
} else {
// 找到目标元素，返回其索引
return m;
}
}
[class]{}-[func]{binarySearch}
/* 二分查找 */
int binarySearch(int nums[], int target, int numsSize) {
int n = numsSize;
// 求解问题 f(0, n-1)
return dfs(nums, target, 0, n - 1);
}
```
=== "Zig"