Check if Every Row and Column Contains All Numbers LeetCode solution in Java

1
class Solution {
2
public boolean checkValid(int[][] matrix) {
3
int n = matrix.length;
4
int num = (n * (n + 1)) / 2; // SUM of n number 1 to n;
5

6
for (int i = 0; i < n; i++) {
7
HashSet<Integer> hs = new HashSet<Integer>();
8
HashSet<Integer> hs1 = new HashSet<Integer>();
9

10
int m = num;
11
int k = num;
12

13
for (int j = 0; j < n; j++) {
14
hs.add(matrix[i][j]);
15
hs1.add(matrix[j][i]);
16
m -= matrix[i][j];
17
k -= matrix[j][i];
18
}
19

20
if (m != 0 || k != 0 || hs.size() != n || hs.size() != n) {
21
return false;
22
}
23
}
24
return true;
25
}
26
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0