mirror of
https://github.com/krahets/hello-algo.git
synced 2025-02-02 22:43:50 +08:00
fix(Go): code comment error (#1404)
* fix: comment error * fix: comment error in zn-hant version
This commit is contained in:
parent
a7c241609f
commit
4190eca41a
@ -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 {
|
||||||
|
@ -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 {
|
||||||
|
Loading…
Reference in New Issue
Block a user