296. Best Meeting Point

A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D grid of values 0 or 1, where each 1 marks the home of someone in the group. The distance is calculated using Manhattan Distance, where distance(p1, p2) = |p2.x - p1.x| + |p2.y - p1.y|.

For example, given three people living at (0,0), (0,4), and (2,2):

1 - 0 - 0 - 0 - 1
|   |   |   |   |
0 - 0 - 0 - 0 - 0
|   |   |   |   |
0 - 0 - 1 - 0 - 0

The point (0,2) is an ideal meeting point, as the total travel distance of 2+2+2=6 is minimal. So return 6.

Hint:

1. Try to solve it in one dimension first. How can this solution apply to the two dimension case?

跟 462. Minimum Moves to Equal Array Elements II思路相似。在一维坐标里，dis = a - b + (b - c) = a - c。二维坐标的最小步数其实是x和y两个方向最小步数的和，所以就是计算两次最小步数，然后相加。代码如下：

public class Solution {
    public int minTotalDistance(int[][] grid) {
        List<Integer> x = new ArrayList<Integer>();
        List<Integer> y = new ArrayList<Integer>();
        for (int i = 0; i < grid.length; i ++) {
            for (int j = 0; j < grid[0].length; j ++) {
                if (grid[i][j] == 1) {
                    x.add(i);
                    y.add(j);
                }
            }
        }
        return getMin(x) + getMin(y);
    }
    
    private int getMin(List<Integer> list) {
        Collections.sort(list);
        int i = 0, j = list.size() - 1, count = 0;
        while (i < j) {
            count += list.get(j --) - list.get(i ++);
        }
        return count;
    }
}