xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-24 03:56:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix(Go): code comment error (#1404)

Browse source 
* fix: comment error

* fix: comment error in zn-hant version
This commit is contained in:
Flamingo 2024-06-28 19:18:17 +08:00 committed by GitHub
parent a7c241609f
commit 4190eca41a
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
codes/go/chapter_divide_and_conquer/binary_search_recur.go
View file

@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
// 递归子问题 f(m+1, j) // 递归子问题 f(m+1, j)
return dfs(nums, target, m+1, j) return dfs(nums, target, m+1, j)
} else if nums[m] > target { } else if nums[m] > target {
// 小于则递归左半数组 // 大于则递归左半数组
// 递归子问题 f(i, m-1) // 递归子问题 f(i, m-1)
return dfs(nums, target, i, m-1) return dfs(nums, target, i, m-1)
} else { } else {

2
zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go
View file

@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
// 遞迴子問題 f(m+1, j) // 遞迴子問題 f(m+1, j)
return dfs(nums, target, m+1, j) return dfs(nums, target, m+1, j)
} else if nums[m] > target { } else if nums[m] > target {
// 小於則遞迴左半陣列 // 大於則遞迴左半陣列
// 遞迴子問題 f(i, m-1) // 遞迴子問題 f(i, m-1)
return dfs(nums, target, i, m-1) return dfs(nums, target, i, m-1)
} else { } else {