forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path_1380.java
40 lines (36 loc) · 1.19 KB
/
_1380.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package com.fishercoder.solutions;
import java.util.ArrayList;
import java.util.List;
public class _1380 {
public static class Solution1 {
public List<Integer> luckyNumbers(int[][] matrix) {
List<Integer> result = new ArrayList<>();
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {
if (luckyInRow(matrix[i][j], matrix[i])) {
if (luckyInColumn(matrix[i][j], matrix, j)) {
result.add(matrix[i][j]);
}
}
}
}
return result;
}
private boolean luckyInColumn(int number, int[][] matrix, int columnIndex) {
for (int i = 0; i < matrix.length; i++) {
if (number < matrix[i][columnIndex]) {
return false;
}
}
return true;
}
private boolean luckyInRow(int number, int[] row) {
for (int num : row) {
if (number > num) {
return false;
}
}
return true;
}
}
}