Best Meeting Point
Total Accepted: 701 Total Submissions: 1714 Difficulty: Medium
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 usingManhattan
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.
[思路]
二維的等於一維的相加, 一維的最小點必在median點(用反證法可以證明).
在二維數組中找到中位數，如果是奇數的數字就取中位數
這個題很巧妙的就是二維數組的距離可以轉化爲2個一維數組的距離求解
http://blog.csdn.net/xudli/article/details/49420623
這裏是比較好的討論
