Problem
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|.
ExampleGiven 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.
Solutionpublic class Solution { /** * @param grid: a 2D grid * @return: the minimize travel distance */ public int minTotalDistance(int[][] grid) { // Write your code here Listx = new ArrayList<>(); List y = new ArrayList<>(); 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 getMD(x) + getMD(y); } public int getMD(List nums) { // zhong dian is here Collections.sort(nums); int i = 0, j = nums.size()-1; int distance = 0; while (i < j) { distance += nums.get(j--) - nums.get(i++); } return distance; } }
文章版权归作者所有,未经允许请勿转载,若此文章存在违规行为,您可以联系管理员删除。
转载请注明本文地址:https://www.ucloud.cn/yun/71398.html
Problem Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings. Example Given intervals = [[0,30],[...
摘要:为了尽量保证右边的点向左走,左边的点向右走,那我们就应该去这些点中间的点作为交点。由于是曼哈顿距离,我们可以分开计算横坐标和纵坐标,结果是一样的。 Best Meeting Point A group of two or more people wants to meet and minimize the total travel distance. You are given a ...
摘要:投射法复杂度思路将二维数组上的点,分别映射到一维的坐标上。然后将两个结果相加。代码分别放到一维上来做复杂度思路分别建立行和列的数组,用来存放,在某一行,或者某一列,一共有多少人在这一个位置上。同理,来处理行的情况。 LeetCode[296] Best Meeting Point A group of two or more people wants to meet and mini...
Problem 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 ...
Problem Given an array, rotate the array to the right by k steps, where k is non-negative. Example Example 1: Input: [1,2,3,4,5,6,7] and k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the r...
阅读 2543·2021-11-18 10:02
阅读 2573·2021-11-15 11:38
阅读 3648·2021-11-12 10:36
阅读 653·2021-11-12 10:34
阅读 2854·2021-10-21 09:38
阅读 1396·2021-09-29 09:48
阅读 1427·2021-09-29 09:34
阅读 1043·2021-09-22 10:02