Shulou(Shulou.com)06/02 Report--

Today, I will talk to you about how to find a two-dimensional array in LeetCode. Many people may not know much about it. In order to make you understand better, the editor has summarized the following content for you. I hope you can get something according to this article.

1. Brief introduction of the problem.

In an n * m two-dimensional array, each row is sorted incrementally from left to right, and each column is sorted incrementally from top to bottom. Please complete a function and enter such a two-dimensional array and an integer to determine whether the array contains the integer.

2, example

The existing matrix matrix is as follows:

[[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] given target = 5, return true.

Given target = 20, return false.

Restrictions:

0

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.