mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -0,0 +1,19 @@
|
||||
<p>Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element.</p>
|
||||
|
||||
<p><strong>Example:</strong></p>
|
||||
|
||||
<p>Given matrix:</p>
|
||||
|
||||
<pre>
|
||||
[
|
||||
[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]
|
||||
]
|
||||
</pre>
|
||||
|
||||
<p>Given target = 5, return <code>true.</code></p>
|
||||
|
||||
<p>Given target = 20, return <code>false.</code></p>
|
Reference in New Issue
Block a user