Leetcode 296 Best Meeting Point
2016-01-29 05:26
302 查看
Best Meeting Point
Total Accepted: 701 Total Submissions: 1714 Difficulty: MediumA 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
这里是比较好的讨论
相关文章推荐
- [Regular Expressions] Introduction
- Leetcode 252 Meeting Rooms
- hdu 1806 RMQ
- hdu 1806 RMQ
- myeclipse 常规web项目创建
- Balanced Binary Tree -- LeetCode
- xfire客户端调用cxf服务端,一直报错
- how to get current path in qt
- 【Leetcode】Copy List with Random Pointer
- ASP.Net中无刷新执行Session身份验证
- LeetCode_40 Combination Sum II
- MSB&LSB与Endianness
- LeetCode_39 Combination Sum
- jquery插件理解看这
- LeetCode_37 Sudoku Solver
- how to add external library in qt under ubuntu
- Group Anagrams -- LeetCode
- 字符串转化为十六进制
- 音乐播放器中的跳动的平衡器
- squeeze函数编写