-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path296 Best Meeting Point.py
46 lines (37 loc) · 1.17 KB
/
296 Best Meeting Point.py
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
38
39
40
41
42
43
44
45
46
"""
Premium Question
Manhattan Distance
Author: Rajeev Ranjan
"""
class Solution(object):
def minTotalDistance_3lines(self, grid):
x = sorted([i for i, row in enumerate(grid) for v in row if v == 1])
y = sorted([j for row in grid for j, v in enumerate(row) if v == 1])
return sum([abs(x[len(x)/2]-i)+abs(y[len(y)/2]-j) for i, row in enumerate(grid) for j, v in enumerate(row) if v == 1])
def minTotalDistance(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
x = []
y = []
m = len(grid)
n = len(grid[0])
for i in xrange(m):
for j in xrange(n):
if grid[i][j] == 1:
x.append(i)
y.append(j)
x.sort()
y.sort()
cnt = len(x)
point = (x[cnt/2], y[cnt/2])
ret = 0
for i in xrange(m):
for j in xrange(n):
if grid[i][j] == 1:
ret += abs(point[0]-i)
ret += abs(point[1]-j)
return ret
if __name__ == "__main__":
assert Solution().minTotalDistance([[1,0,0,0,1],[0,0,0,0,0],[0,0,1,0,0]]) == 6