You have an elevation map and you want to know the shortest climbing route.
The map is given as a list of strings.
- 0 : plain ( elevation is 0)
- 1-9 : hill (number is elevation)
"mountain" is adjacent (only 4 directions) hill group.
- It consists of two or more hills.
- Isolated hill is not mountain.
Start is top-left. Goal is bottom-right. You have to go over all the mountaintops. You can only move vertical and horizontal. And you can only move to the same or one elevation difference. You should look for the shortest route and return Number of steps. (if mountains do not exist, You may go to the goal at the shortest from the start.)
Input: A elevation map as a list of strings.
Output: number of steps as Integer.
climbingRoute(['000', '120', '000']) == 6 climbingRoute(['000000002110', '011100002310', '012100002220', '011100000000']) == 26
How it is used: Geographic analysis, Game map design and so on.
elevation_map == elevation_map[-1][-1] == '0'
3 ≤ len(elevation_map)
all(3 ≤ len(row) and len(row) == len(elevation_map) for row in elevation__map)
Each mountain has only one mountaintop.
There is no mountain that can not climb.