add 624

Author: fishercoder1534

README.md

@@ -20,6 +20,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
+|624|[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) | O(nlogn) |O(1) | Easy | Sort, Array
 |617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) | O(n) |O(h) | Easy | Tree, Recursion
 |616|[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) | O(n*k) (n is length of string, k is size of dict) |O(n) | Medium | String
 |611|[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_611.java) | O(n^2logn) |O(logn) | Medium | Binary Search

src/main/java/com/fishercoder/solutions/_624.java

@@ -0,0 +1,48 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+/**
+ * 624. Maximum Distance in Arrays
+ *
+ * Given m arrays, and each array is sorted in ascending order.
+ * Now you can pick up two integers from two different arrays (each array picks one)
+ * and calculate the distance. We define the distance between two
+ * integers a and b to be their absolute difference |a-b|. Your task is to find the maximum distance.
+
+ Example 1:
+ Input:
+ [[1,2,3],
+ [4,5],
+ [1,2,3]]
+
+ Output: 4
+
+ Explanation:
+
+ One way to reach the maximum distance 4 is to pick 1 in the first or third array and pick 5 in the second array.
+
+ Note:
+ Each given array will have at least 1 number. There will be at least two non-empty arrays.
+ The total number of the integers in all the m arrays will be in the range of [2, 10000].
+ The integers in the m arrays will be in the range of [-10000, 10000].
+ */
+public class _624 {
+
+    public int maxDistance(int[][] arrays) {
+        List<Integer> max = new ArrayList<>();
+        for (int[] array : arrays) {
+            max.add(array[array.length-1]);
+        }
+        Collections.sort(max);
+        int ans = Integer.MIN_VALUE;
+        for (int[] array : arrays) {
+            int big = array[array.length-1] == max.get(max.size()-1) ? max.get(max.size()-2) : max.get(max.size()-1);
+            ans = Math.max(ans, big - array[0]);
+        }
+        return ans;
+    }
+
+}