1
class Solution {
2
  public int numSpecial(int[][] mat) {
3
    int count = 0;
4
    for (int i = 0; i < mat.length; i++) {
5
      for (int j = 0; j < mat[0].length; j++) {
6
        if (mat[i][j] == 1) {
7
          int flag = 0;
8
          for (int k = 0; k < mat.length; k++) {
9
            if (mat[k][j] != 0 && k != i) {
10
              flag = 1;
11
              break;
12
            }
13
          }
14
          if (flag == 1) continue;
15
          for (int k = 0; k < mat[0].length; k++) {
16
            if (mat[i][k] != 0 && k != j) {
17
              flag = 1;
18
              break;
19
            }
20
          }
21
          if (flag == 0) count++;
22
        }
23
      }
24
    }
25
    return count;
26
  }
27
}