Manhattan skyline def manhattan_skyline(towers): This classic problem in computational geometry (essentially, geometry that can be done using only integer arithmetic; yes, that is an actual thing) is best illustrated by pictures and animations such as those on the page "The Skyline problem", so you can first check that it out to get an idea of what is going on. Given a list of rectangular towers as tuples (s, e, h) where s and e are the start and end x-coordinates (satisfying e>s) and h is the height of that tower, compute and return the total visible area of the towers, being careful not to double count two or more towers that are partially overlapping. All towers share the same flat ground baseline at the height. The classic solution illustrates the important sweep line technique that starts by creating a list of precisely those x-coordinate values where something relevant to the problem takes place. In this problem, the relevant x-coordinates are those where some tower either starts or ends. Next, loop through this list in ascending order, updating your computation for the interval between the current relevant x-coordinate and the previous one. In this particular problem, you need to maintain a list of active towers so that tower (s, e, h) becomes active when x==s, and becomes inactive again when x==e. Inside each interval, only the tallest active tower affects the area summation. The automated tester script will produce start and end coordinates from an increasing scale to prevent this problem being solved with the inferior method that builds up the list of all positions from zero up to the maximum end coordinate in towers, loops through the towers to update the tallest tower height at each position, and sums up these heights for the final area.
Manhattan skyline
def manhattan_skyline(towers):
This classic problem in computational geometry (essentially, geometry that can be done using only integer arithmetic; yes, that is an actual thing) is best illustrated by pictures and animations such as those on the page "The Skyline problem", so you can first check that it out to get an idea of what is
going on. Given a list of rectangular towers as tuples (s, e, h) where s and e are the start and end x-coordinates (satisfying e>s) and h is the height of that tower, compute and return the total visible area of the towers, being careful not to double count two or more towers that are partially
overlapping. All towers share the same flat ground baseline at the height.
The classic solution illustrates the important sweep line technique that starts by creating a list of precisely those x-coordinate values where something relevant to the problem takes place. In this problem, the relevant x-coordinates are those where some tower either starts or ends. Next, loop through this list in ascending order, updating your computation for the interval between the current relevant x-coordinate and the previous one. In this particular problem, you need to maintain a list of active towers so that tower (s, e, h) becomes active when x==s, and becomes inactive
again when x==e. Inside each interval, only the tallest active tower affects the area summation.
The automated tester script will produce start and end coordinates from an increasing scale to prevent this problem being solved with the inferior method that builds up the list of all positions from zero up to the maximum end coordinate in towers, loops through the towers to update the tallest tower height at each position, and sums up these heights for the final area.
![towers
Expected result
[ (2, 3, 39)]
39
[ (6, 8, 56), (5, 14, 81), (3, 13, 71)]
871
[ (6,
93)]
18, 95), (3, 20, 95), (14, 31, 22), (5, 12, 1857
[(16, 88, 20), (11, 75, 22), (43, 73, 27), (21,
42, 37), (20, 89, 12), (67, 68, 19), (1, 65,
24), (78, 91, 34), (65, 117, 9)]
2871](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8989f20f-4778-4596-9f56-d6b621379690%2Fe5624927-c0f7-43c1-b404-09a73812f7e6%2Fzxup7t6_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
