Coordinate With Maximum Network Quality LeetCode solution in JavaScript

1
var bestCoordinate = function (towers, radius) {
2
  const n = towers.length;
3
  const grid = [];
4

5
  for (let i = 0; i <= 50; i++) {
6
    grid[i] = new Array(51).fill(0);
7
  }
8

9
  for (let i = 0; i < n; i++) {
10
    const [x1, y1, quality1] = towers[i];
11

12
    for (let x2 = 0; x2 <= 50; x2++) {
13
      for (let y2 = 0; y2 <= 50; y2++) {
14
        const dist = Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);
15

16
        if (dist > radius) continue;
17

18
        const network = Math.floor(quality1 / (1 + dist));
19

20
        grid[x2][y2] += network;
21
      }
22
    }
23
  }
24

25
  let maxX = 0;
26
  let maxY = 0;
27
  let maxVal = grid[0][0];
28

29
  for (let i = 0; i <= 50; i++) {
30
    for (let j = 0; j <= 50; j++) {
31
      const val = grid[i][j];
32

33
      if (val > maxVal) {
34
        maxVal = val;
35
        maxX = i;
36
        maxY = j;
37
      } else if (val === maxVal) {
38
        if (i < maxX || (i === maxX && j < maxY)) {
39
          maxVal = val;
40
          maxX = i;
41
          maxY = j;
42
        }
43
      }
44
    }
45
  }
46

47
  return [maxX, maxY];
48
};