Class Solution

java.lang.Object
g0001_0100.s0074_search_a_2d_matrix.Solution

public class Solution extends Object
74 - Search a 2D Matrix.<p>Medium</p> <p>Write an efficient algorithm that searches for a value in an <code>m x n</code> matrix. This matrix has the following properties:</p> <ul> <li>Integers in each row are sorted from left to right.</li> <li>The first integer of each row is greater than the last integer of the previous row.</li> </ul> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/05/mat.jpg" alt="" /></p> <p><strong>Input:</strong> matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3</p> <p><strong>Output:</strong> true</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/05/mat2.jpg" alt="" /></p> <p><strong>Input:</strong> matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == matrix.length</code></li> <li><code>n == matrix[i].length</code></li> <li><code>1 <= m, n <= 100</code></li> <li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • searchMatrix

      public boolean searchMatrix(int[][] matrix, int target)