-
Notifications
You must be signed in to change notification settings - Fork 1
/
240.搜索二维矩阵-ii.go
60 lines (59 loc) · 1.21 KB
/
240.搜索二维矩阵-ii.go
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
/*
* @lc app=leetcode.cn id=240 lang=golang
*
* [240] 搜索二维矩阵 II
*
* https://leetcode-cn.com/problems/search-a-2d-matrix-ii/description/
*
* algorithms
* Medium (36.74%)
* Likes: 99
* Dislikes: 0
* Total Accepted: 15.3K
* Total Submissions: 41.7K
* Testcase Example: '[[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]]\n5'
*
* 编写一个高效的算法来搜索 m x n 矩阵 matrix 中的一个目标值 target。该矩阵具有以下特性:
*
*
* 每行的元素从左到右升序排列。
* 每列的元素从上到下升序排列。
*
*
* 示例:
*
* 现有矩阵 matrix 如下:
*
* [
* [1, 4, 7, 11, 15],
* [2, 5, 8, 12, 19],
* [3, 6, 9, 16, 22],
* [10, 13, 14, 17, 24],
* [18, 21, 23, 26, 30]
* ]
*
*
* 给定 target = 5,返回 true。
*
* 给定 target = 20,返回 false。
*
*/
func searchMatrix(matrix [][]int, target int) bool {
rowLen := len(matrix)
if rowLen <= 0 {
return false
}
col := len(matrix[0]) - 1
row := 0
for row < rowLen && col >= 0 {
num := matrix[row][col]
if num == target {
return true
} else if num > target {
col--
} else {
row++
}
}
return false
}