add 1620

fishercoder1534 · fishercoder1534 · commit 52d10e25c0ec · 2020-10-18T07:47:53.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1620|[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) ||Greedy|Medium|
 |1614|[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java) ||Easy|String|
 |1609|[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) ||Medium|Tree|
 |1608|[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1620.java b/src/main/java/com/fishercoder/solutions/_1620.java
@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+public class _1620 {
+    public static class Solution1 {
+        public static int[] bestCoordinate(int[][] towers, int radius) {
+            int maxSignal = 0;
+            int[] best = new int[2];
+            for (int i = 0; i < towers.length; i++) {
+                int thisQuality = 0;
+                for (int j = 0; j < towers.length; j++) {
+                    double distance = Math.sqrt((towers[i][0] - towers[j][0]) * (towers[i][0] - towers[j][0]) + (towers[i][1] - towers[j][1]) * (towers[i][1] - towers[j][1]));
+                    if (distance <= radius) {
+                        thisQuality += Math.floor(towers[j][2] / (1 + distance));
+                    }
+                }
+                if (thisQuality > maxSignal) {
+                    maxSignal = thisQuality;
+                    best[0] = towers[i][0];
+                    best[1] = towers[i][1];
+                } else if (thisQuality == maxSignal) {
+                    if (towers[i][0] < best[0]) {
+                        best[0] = towers[i][0];
+                        best[1] = towers[i][1];
+                    } else if (towers[i][0] == best[0] && towers[i][1] < best[1]) {
+                        best[0] = towers[i][0];
+                        best[1] = towers[i][1];
+                    }
+                }
+            }
+            return best;
+        }
+    }
+}
