Add solution #624

Author: JoshCrozier

README.md

@@ -473,6 +473,7 @@
 621|[Task Scheduler](./0621-task-scheduler.js)|Medium|
 622|[Design Circular Queue](./0622-design-circular-queue.js)|Medium|
 623|[Add One Row to Tree](./0623-add-one-row-to-tree.js)|Medium|
+624|[Maximum Distance in Arrays](./0624-maximum-distance-in-arrays.js)|Medium|
 628|[Maximum Product of Three Numbers](./0628-maximum-product-of-three-numbers.js)|Easy|
 637|[Average of Levels in Binary Tree](./0637-average-of-levels-in-binary-tree.js)|Easy|
 643|[Maximum Average Subarray I](./0643-maximum-average-subarray-i.js)|Easy|

solutions/0624-maximum-distance-in-arrays.js

@@ -0,0 +1,33 @@
+/**
+ * 624. Maximum Distance in Arrays
+ * https://leetcode.com/problems/maximum-distance-in-arrays/
+ * Difficulty: Medium
+ *
+ * You are given m arrays, where each array is sorted in ascending order.
+ *
+ * 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|.
+ *
+ * Return the maximum distance.
+ */
+
+/**
+ * @param {number[][]} arrays
+ * @return {number}
+ */
+var maxDistance = function(arrays) {
+  let result = 0;
+  let min = arrays[0][0];
+  let max = arrays[0][arrays[0].length - 1];
+
+  for (let i = 1; i < arrays.length; i++) {
+    const newMin = arrays[i][0];
+    const newMax = arrays[i][arrays[i].length - 1];
+    result = Math.max(result, Math.abs(newMax - min), Math.abs(max - newMin));
+    min = Math.min(min, newMin);
+    max = Math.max(max, newMax);
+  }
+
+  return result;
+};