Post

624 Maximum Distance In Arrays

Posted Updated
By Anurag
1 min read
624 Maximum Distance In Arrays

Maximum Distance in Arrays imagenull

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37


class Solution:
    def maxDistance(self, arrays: List[List[int]]) -> int:
        start_elem = []
        end_elem = []
        

        for i,k in enumerate(arrays):
            heapq.heappush(start_elem, (k[0],i))

        for i,k in enumerate(arrays):
            heapq.heappush(end_elem, (-1 * k[len(k)-1],i) ) 
        diff = 0
        min_elem = 0
        max_elem = 0
        is_first = True
        while (len(start_elem) > 0):
            a = heapq.heappop(start_elem)
            b = heapq.heappop(end_elem)
            #print(a,b)
            if a[1] != b[1] and is_first:
                return abs(a[0] + b[0])
            else: 
                if is_first:
                    min_elem = a[0]
                    max_elem = b[0]
                    is_first = False
                else:
                    return max(abs(min_elem + b[0]), abs(max_elem + a[0] ))

        return 0
leetcode
python
This post is licensed under CC BY 4.0 by the author.