Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1380 - Lucky Numbers in a Matrix\.

    Easy

    Given an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order.

    A lucky number is an element of the matrix such that it is the minimum element in its row and maximum in its column.

    Example 1:

    Input: matrix = \[\[3,7,8],9,11,13,15,16,17]

    Output: 15

    Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column.

    Example 2:

    Input: matrix = \[\[1,10,4,2],9,3,8,7,15,16,17,12]

    Output: 12

    Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column.

    Example 3:

    Input: matrix = \[\[7,8],1,2]

    Output: 7

    Explanation: 7 is the only lucky number since it is the minimum in its row and the maximum in its column.

    Constraints:

    • m == mat.length

    • n == mat[i].length

    • 1 <= n, m <= 50

    • <code>1 <= matrixj<= 10<sup>5</sup></code>.

    • All elements in the matrix are distinct.

    • 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 List<Integer> luckyNumbers(Array<IntArray> matrix)
      • Methods inherited from class java.lang.Object

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