Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
pangzhiqiang
committed
Oct 25, 2020
1 parent
1df16d6
commit 3f4a85d
Showing
1 changed file
with
51 additions
and
0 deletions.
There are no files selected for viewing
51 changes: 51 additions & 0 deletions
51
controller/algorithm/er-wei-shu-zu-zhong-de-cha-zhao-lcof.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
package algorithm | ||
|
||
/* | ||
原题:https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/ | ||
剑指 Offer 04. 二维数组中的查找 | ||
在一个 n * m 的二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。 | ||
示例: | ||
现有矩阵 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。 | ||
限制: | ||
0 <= n <= 1000 | ||
0 <= m <= 1000 | ||
*/ | ||
|
||
func findNumberIn2DArray(matrix [][]int, target int) bool { | ||
length := len(matrix) | ||
if length == 0 { | ||
return false | ||
} | ||
row := length - 1 | ||
col := 0 | ||
for row >= 0 && col < len(matrix[0]) { | ||
if matrix[row][col] == target { | ||
return true | ||
} else if matrix[row][col] > target { | ||
row-- | ||
} else { | ||
col++ | ||
} | ||
} | ||
return false | ||
} |