Package g0201_0300.s0240_search_a_2d_matrix_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    240 - Search a 2D Matrix II\.

    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 in ascending from left to right.

    • Integers in each column are sorted in ascending from top to bottom.

    Example 1:

    Input: 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

    Output: true

    Example 2:

    Input: 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 = 20

    Output: false

    Constraints:

    • m == matrix.length

    • n == matrix[i].length

    • 1 <= n, m <= 300

    • <code>-10<sup>9</sup><= matrixj<= 10<sup>9</sup></code>

    • All the integers in each row are sorted in ascending order.

    • All the integers in each column are sorted in ascending order.

    • <code>-10<sup>9</sup><= target <= 10<sup>9</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