@@ -13,7 +13,7 @@ def __init__(self, N):
13
13
"""
14
14
self .__num = N
15
15
self .__seats = {- 1 : [- 1 , self .__num ], self .__num : [- 1 , self .__num ]}
16
- self .__max_heap = [(- self .distance ((- 1 , self .__num )), - 1 , self .__num )]
16
+ self .__max_heap = [(- self .__distance ((- 1 , self .__num )), - 1 , self .__num )]
17
17
18
18
def seat (self ):
19
19
"""
@@ -30,8 +30,8 @@ def seat(self):
30
30
else self .__num - 1 if right == self .__num \
31
31
else (left + right ) // 2
32
32
self .__seats [mid ] = [left , right ]
33
- heapq .heappush (self .__max_heap , (- self .distance ((left , mid )), left , mid ))
34
- heapq .heappush (self .__max_heap , (- self .distance ((mid , right )), mid , right ))
33
+ heapq .heappush (self .__max_heap , (- self .__distance ((left , mid )), left , mid ))
34
+ heapq .heappush (self .__max_heap , (- self .__distance ((mid , right )), mid , right ))
35
35
self .__seats [left ][1 ] = mid
36
36
self .__seats [right ][0 ] = mid
37
37
return mid
@@ -45,9 +45,9 @@ def leave(self, p):
45
45
self .__seats .pop (p )
46
46
self .__seats [left ][1 ] = right
47
47
self .__seats [right ][0 ] = left
48
- heapq .heappush (self .__max_heap , (- self .distance ((left , right )), left , right ))
48
+ heapq .heappush (self .__max_heap , (- self .__distance ((left , right )), left , right ))
49
49
50
- def distance (self , segment ):
50
+ def __distance (self , segment ):
51
51
return segment [1 ]- segment [0 ]- 1 if segment [0 ] == - 1 or segment [1 ] == self .__num \
52
52
else (segment [1 ]- segment [0 ]) // 2
53
53
0 commit comments