mfocko/LeetCode
1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-16 16:36:56 +02:00
Code Issues Projects Releases Wiki Activity

java: add «1380. Lucky Numbers in a Matrix»

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2024-07-19 10:11:48 +02:00
parent 4e0ce85262
commit bf30ec7ec7
Signed by: mfocko
SSH key fingerprint: SHA256:icm0fIOSJUpy5+1x23sfr+hLtF9UhY8VpMC7H4WFJP8
1 changed files with 29 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

29
java/lucky-numbers-in-a-matrix.java Normal file
View file

@ -0,0 +1,29 @@
class Solution {
public List<Integer> luckyNumbers(int[][] matrix) {
int rows = matrix.length, cols = matrix[0].length;
int rowCandidate = Integer.MIN_VALUE;
for (int y = 0; y < rows; ++y) {
int currentRow = matrix[y][0];
for (int x = 1; x < cols; ++x) {
currentRow = Math.min(currentRow, matrix[y][x]);
}
rowCandidate = Math.max(rowCandidate, currentRow);
}
int colCandidate = Integer.MAX_VALUE;
for (int x = 0; x < cols; ++x) {
int currentCol = matrix[0][x];
for (int y = 1; y < rows; ++y) {
currentCol = Math.max(currentCol, matrix[y][x]);
}
colCandidate = Math.min(colCandidate, currentCol);
}
if (rowCandidate == colCandidate) {
return Arrays.asList(rowCandidate);
}
return List.<Integer>of();
}
}