Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1380 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1380 # by problem number
lcpy gen -s lucky_numbers_in_a_matrix # by problem name
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.
Input: matrix = [[3,7,8],[9,11,13],[15,16,17]]
Output: [15]
Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]]
Output: [12]
Input: matrix = [[7,8],[1,2]]
Output: [7]
class Solution:
# Time: O(m * n)
# Space: O(n)
def lucky_numbers(self, matrix: list[list[int]]) -> list[int]:
col_max = [max(col) for col in zip(*matrix, strict=True)]
return [row_min for row in matrix if (row_min := min(row)) in col_max]
| Time | Space |
|---|---|
| O(m * n) | O(n) |