add FlyingDrones1D solution

Author: jakovmitrovski

easiest100/FlyingDrones1D.java

@@ -0,0 +1,29 @@
+package easiest100;
+
+public class FlyingDrones1D {
+    public String findMinTime(String[] positions) {
+
+        double dist = 0.0;
+
+        for (int i = 0; i < positions.length; i++)
+            for (int j = i + 1; j < positions.length; j++)
+                dist = Math.max(Math.abs((Double.parseDouble(positions[i]) / 2 - Double.parseDouble(positions[j]) / 2)),
+                        dist);
+
+        // dist = Math.round(dist*100)/100.0 + 0.001;
+
+        return String.format("%.2f", dist + 0.001);
+    }
+
+    public static void main(String[] args) {
+        FlyingDrones1D f = new FlyingDrones1D();
+        System.out.println(f.findMinTime(new String[] { "1.00", "3.00" }));
+        System.out.println(f.findMinTime(new String[] { "-135575.03", "2103.82", "-4358.50", "9843.94", "-1319.35",
+                "8769.30", "-6043.66", "2183.50", "-1015.66", "-200.89", "-3964.38", "74.36", "-9752.16", "-2053.71",
+                "2238.21", "565.86", "3388.29", "-6950.11", "-8383.31", "5194.07", "-4953.59", "-7999.04", "8747.18",
+                "4668.17", "-4348.95", "-6528.72", "-7751.13", "-5373.13", "6672.59", "2788.17", "-1121.10", "-6908.90",
+                "1085.73", "9814.95", "-1417.15", "2281.51", "3944.57", "-7786.14", "-3692.73", "3211.29", "2853.94",
+                "-1949.05", "-462.70", "525.36", "275487.16" }));
+    }
+
+}