Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

fix(Go): code comment error #1404

Merged
merged 2 commits into from
Jun 28, 2024
Merged

fix(Go): code comment error #1404

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
bedc912
fix: comment error
Transmigration-zhou Jun 27, 2024
2dfa936
fix: comment error in zn-hant version
Transmigration-zhou Jun 27, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion codes/go/chapter_divide_and_conquer/binary_search_recur.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
// 递归子问题 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 {
Expand Down
2 changes: 1 addition & 1 deletion zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
// 遞迴子問題 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 {
Expand Down
Loading