菜鸟的每日力扣系列——1380. 矩阵中的幸运数（#Day38）

from typing import List


def luckyNumbers(matrix: List[List[int]]) -> List[int]:
    rows_min = [min(rows) for rows in matrix]  # 每行中最小值，下标即为列号
    cols_max = [max(cols) for cols in zip(*matrix)]  # 每列中最大值，下标即为行号
    res = []
    print(rows_min)  # [3, 9, 15]
    print(cols_max)  # [15, 16, 17]
    for i, row in enumerate(matrix):
        for j, value in enumerate(row):
            if value == rows_min[i] and value == cols_max[j]:
                res.append(value)
    return res


matrix = [[3, 7, 8], [9, 11, 13], [15, 16, 17]]
print(luckyNumbers(matrix))  # [15]

package main

import "fmt"

func min(a, b int) int {
  if a < b {
    return a
  }
  return b
}

func max(a, b int) int {
  if a > b {
    return a
  }
  return b
}

func luckyNumbers(matrix [][]int) []int {
  a, b := 0, 100005
  for _, row := range matrix {
    cur := 100005
    for _, v := range row {
      cur = min(v, cur) // 维护行的最小值
    }
    a = max(a, cur)
  }
  for j := 0; j < len(matrix[0]); j++ {
    cur := 0
    for i := 0; i < len(matrix); i++ {
      cur = max(matrix[i][j], cur) // 找到列中的最大值
    }
    b = min(b, cur)
  }
  if a == b {
    return []int{a}
  }
  return []int{}
}

func main() {
  var matrix = [][]int{{3, 7, 8}, {9, 11, 13}, {15, 16, 17}}
  fmt.Println(matrix)               // [[3 7 8] [9 11 13] [15 16 17]]
  fmt.Println(luckyNumbers(matrix)) // [15]
}