[leetcode] 1380. 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:

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]

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.

分析

题目的意思是：找出一个矩阵里面的幸运数，幸运数的定义为所在的行为最小值，所在的列为最大值。我的思路也是很简单，对每行进行遍历，找到最小值后判断其是否为该列的最大值。我也看了别人的实现，还有一种思路是先行遍历找到所有的最小值，然后再列遍历找到所有的最大值，然后行和列的值相等即行最小值等于列最大值，即为所求。

代码

class Solution:
    def luckyNumbers (self, matrix: List[List[int]]) -> List[int]:
        m=len(matrix)
        n=len(matrix[0])
        res=[]
        for i in range(m):
            p=0
            for j in range(1,n):
                if(matrix[i][p]>matrix[i][j]):
                    p=j
            flag=True
            for q in range(m):
                if(matrix[i][p]<matrix[q][p]):
                    flag=False
                    break
            if(flag):
                res.append(matrix[i][p])
        return res

参考文献

[LeetCode] Easiest Solution