Best Meeting Point

Problem: Best Meeting Point

We select median of row and column positions as our answer.

Code in Python:

class Solution(object):
    def minTotalDistance(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        sum_i = [i for i in xrange(len(grid)) for j in xrange(len(grid[0])) if grid[i][j]]
        sum_j = [j for j in xrange(len(grid[0])) for i in xrange(len(grid)) if grid[i][j]]
        mid_i = sum_i[len(sum_i)/2]
        mid_j = sum_j[len(sum_j)/2]
        return sum([abs(i-mid_i)+abs(j-mid_j) for i in xrange(len(grid)) for j in xrange(len(grid[0])) if grid[i][j]])