1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
| // @Title: 搜索二维矩阵 II (Search a 2D Matrix II)
// @Author: 15816537946@163.com
// @Date: 2021-10-25 21:22:30
// @Runtime: 24 ms
// @Memory: 6.7 MB
func searchMatrix(matrix [][]int, target int) bool {
for i:=0;i<len(matrix);i++ {
for j:=0;j<len(matrix[0]);j++ {
if target == matrix[i][j] {
return true
}
}
}
return false
/*
nLen:= len(matrix)-1
mLen := len(matrix[0])-1
var dfs func(int, int) bool
dfs = func(i,j int ) bool {
if i > nLen || j> mLen {
return false
}
if matrix[i][j] == target {
return true
}
return dfs(i+1,j) || dfs(i,j+1)
}
return dfs(0, 0)
*/
/*
if matrix[0][0] == target {
return true
}
var i,j int
for i< nLen && j< mLen{
fmt.Println(matrix[i][j])
if matrix[i][j+1] == target || matrix[i+1][j] == target {
return true
}
if matrix[i][j+1]< matrix[i+1][j] {
j++
} else {
i++
}
if matrix[i][j] == target {
return true
}
}
return matrix[nLen][mLen] == target
*/
}
|