Package g0001_0100.s0074_search_a_2d_matrix

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    74 - Search a 2D Matrix.

    Medium

    Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:

    • Integers in each row are sorted from left to right.

    • The first integer of each row is greater than the last integer of the previous row.

    Example 1:

    Input: matrix = [1,3,5,7,10,11,16,20,23,30,34,60], target = 3

    Output: true

    Example 2:

    Input: matrix = [1,3,5,7,10,11,16,20,23,30,34,60], target = 13

    Output: false

    Constraints:

    • m == matrix.length

    • n == matrix[i].length

    • 1 <= m, n <= 100

    • <code>-10<sup>4</sup><= matrixj, target <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean searchMatrix(Array<IntArray> matrix, Integer target)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait