[Leet Code] Lucky numbers in a matric

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
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.
Input: matrix = [[7,8],[1,2]]
Output: [7]
class Solution(object):
def luckyNumbers (self, matrix):
"""
:type matrix: List[List[int]]
:rtype: List[int]
"""
answers = []
for i in range(len(matrix)):
row = matrix[i].index(min(matrix[i]))
if min(matrix[i]) == max([column[row] for column in matrix]):
answers.append(matrix[i][row])


return answers

--

--

--

Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.

DDD: Decoupling your Laravel API from your Database

System Designing basics- Designing a Distributed Storage Service in Cloud

Simple first-person controls in Unity

The ‘Fresh Developer’ Principles

Design and Analysis of Algorithms

Puzzles in the Terraverse: Chapter 1

Apache Guacamole Local and/or AWS Install

Xenoblade系列最新作「Xenoblade Chronicles 3」發售!預定在2022年9月發售!

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Matthew Boyd

Matthew Boyd

Learning, and posting my findings!

More from Medium

Restore IP Addresses | LeetCode-93: Medium | JavaScript Implementation

Missing Number 🍀

Solve: Maximum Subarray

Sliding Window: Find Maximum Sum of Subarray of Size K