每日一题---1380. 矩阵中的幸运数[力扣][Go]

func luckyNumbers (matrix [][]int) []int {
    sum := []int{}
    // 记录每行最小值
    m1 := make(map[int]int)
    for i, ints := range matrix {
        min := ints[0]
        for _, n := range ints {
            if min > n {
                min = n
            }
        }
        m1[i] = min
    }
    // 记录每列最大值
    m2 := make(map[int]int)
    for i := 0; i < len(matrix[0]); i++ {
        max := matrix[0][i]
        for j := 0; j < len(matrix); j++ {
            if max < matrix[j][i] {
                max = matrix[j][i]
            }
        }
        m2[i] = max
    }
    // 最后一次遍历找出符合的数字
    for i, ints := range matrix {
        for i2, i3 := range ints {
            if i3 == m1[i] && i3 == m2[i2]{
                sum = append(sum, i3)
                break
            }
        }
    }
    return sum
}