Skip to content

Commit af959fa

Browse files
author
Joseph Luce
authored
Update shortest_distance_from_all_buildings.md
1 parent 449195d commit af959fa

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

real_interview_questions/Google/shortest_distance_from_all_buildings.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -19,11 +19,12 @@ Output: 7
1919
Explanation: Given three buildings at (0,0), (0,4), (2,2), and an obstacle at (0,2),
2020
the point (1,2) is an ideal empty land to build a house, as the total
2121
travel distance of 3+3+1=7 is minimal. So return 7.
22-
Note:
23-
There will be at least one building. If it is not possible to build such house according to the above rules, return -1.
2422
2523
```
2624

25+
Note:
26+
There will be at least one building. If it is not possible to build such house according to the above rules, return -1.
27+
2728
# SOLUTION (Time Limit Exceeded)
2829
```
2930
class Solution(object):

0 commit comments

Comments
 (0)