杨氏矩阵 go 实现练习
使用先行搜索方式,最近开始使用go, 或许带有少许python的味道,欢迎指正批评
//
package main
import "fmt"
func main() {
// 2d array
d_tow := [5][4]int{
{1, 2, 8, 9},
{2, 4, 9, 12},
{4, 7, 10, 13},
{6, 8, 11, 15},
{8, 9, 13, 17},
}
// c = 4 c >= 0 rows = 4
res := y_check(d_tow, 11)
fmt.Println(res)
}
func y_check(arr [5][4]int, target int) (jug bool) {
var rows = len(arr)
var clos = len(arr[0]) - 1
nc := 0
for nc <= rows && clos > 0 {
if arr[nc][clos] == target {
fmt.Println(nc, clos)
jug = true
return
}
if arr[nc][clos] > target {
clos--
fmt.Println(clos)
} else {
nc++
}
}
jug = false
return
}