The Highest Building
The main architect of the city wants to build a new highest building.
You have to help him find the current highest building in the city.
Input: Heights of the buildings as a 2D-list. Building height is defined as a column in a list.
Output: The number of the highest building and height of it as a list of integers (Important: in this task the building numbers starts from "1", not from "0").
Examples:
assert highest_building([[0, 0, 1, 0], [1, 0, 1, 0], [1, 1, 1, 0], [1, 1, 1, 1]]) == [
3,
4,
]
assert highest_building([[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 1]]) == [
4,
1,
]
How it is used: Every true programmer should know how to work with the 2D-lists.
Preconditions:
- array width <= 10;
- array height <= 10;
- there is only 1 highest building in each array.
