1380. Lucky Numbers in a Matrix
https://leetcode.com/problems/lucky-numbers-in-a-matrix
Description
Given a m * 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:
Example 2:
Example 3:
Constraints:
m == mat.length
n == mat[i].length
1 <= n, m <= 50
1 <= matrix[i][j] <= 10^5
.All elements in the matrix are distinct.
ac
Previous1379. Find a Corresponding Node of a Binary Tree in a Clone of That TreeNext1381. Design a Stack With Increment Operation
Last updated