624. Maximum Distance in arrays binary array maximum difference distance

[Copy question]:

Given m arrays, and each of the array is sorted in ascending order. Now you can pick up to integers from, different arrays (each array picks one) and calculate the distance. We define the distance between the integers and to be their absolute difference a b |a-b| . Your task is to find the maximum distance.

Example 1:

Input: [[1], [4,5], [1,2,3]]output:4explanation:one-to reach the maximum distance 4 are to pick in the first or Third array and pick 5 in the second array.

[Brute force solution]:

Time Analysis:

Spatial Analysis:

[After optimization]:

Time Analysis:

Spatial Analysis:

[Wonderful output CONDITIONS]:

[Wonderful corner case]:

[Thinking questions]:

[a sentence of thought]:

The absolute value of the difference has a maximum of two cases: maximum minus minimum, minimum minus maximum

[input]: null: Normal: Large: Extra Small: Special cases handled in the program: abnormal conditions (unreasonable input):

[Drawing]:

[One brush]:

[Two brushes]:

[Three brushes]:

[Four brushes]:

[Five brushes]:

[Results of five-minute visual debug]:

[Summary]:

[Complexity]:time Complexity:o () Space complexity:o ()

[English data structure or algorithm, why not other data structures or algorithms]:

How to write the get method of forgetting a linked list

[Key templating code]:

[Other solutions]:

[Follow up]:

[The problem given by the LC becomes variable]:

[Code Style]:

624. Maximum Distance in arrays the maximum distance between values in a binary array