I'm currently on a system without a Chinese keyboard, so please pardon my obnoxious writing skills.
My work-around mainly focuses on the runtime duration, so space complexity is not considered in this scenario.
The total sum of maneuver combinations when climbing N stairs is exactly the N + 1s element of the fibonacci sequence.