0296. Best Meeting Point
https://leetcode.com/problems/best-meeting-point
Description
Given an m x n
binary grid grid
where each 1
marks the home of one friend, return the minimal total travel distance.
The total travel distance is the sum of the distances between the houses of the friends and the meeting point.
The distance is calculated using Manhattan Distance, where distance(p1, p2) = |p2.x - p1.x| + |p2.y - p1.y|
.
Example 1:
Example 2:
Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 200
grid[i][j]
is either0
or1
.There will be at least two friends in the
grid
.
ac
Last updated