Coordinate With Maximum Network Quality LeetCode solution in Java

1
class Solution {
2
  public int[] bestCoordinate(int[][] towers, int radius) {
3
    int minX = 51, maxX = 0, minY = 51, maxY = 0, max = 0;
4
    int[] res = new int[2];
5
    for (int[] t : towers) {
6
      minX = Math.min(minX, t[0]);
7
      maxX = Math.max(maxX, t[0]);
8
      minY = Math.min(minY, t[1]);
9
      maxY = Math.max(maxY, t[1]);
10
    }
11
    for (int i = minX; i <= maxX; i++) {
12
      for (int j = minY; j <= maxY; j++) {
13
        int sum = 0;
14
        for (int[] t : towers) {
15
          int d = (t[0] - i) * (t[0] - i) + (t[1] - j) * (t[1] - j);
16
          if (d <= radius * radius) {
17
            sum += t[2] / (1 + Math.sqrt(d));
18
          }
19
        }
20
        if (sum > max) {
21
          max = sum;
22
          res = new int[] {i, j};
23
        }
24
      }
25
    }
26
    return res;
27
  }
28
}