/**
 * You are climbing a staircase. It takes n steps to reach the top.
 *
 * Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
 *
 *
 *
 * Example 1:
 *
 * Input: n = 2
 * Output: 2
 * Explanation: There are two ways to climb to the top.
 * 1. 1 step + 1 step
 * 2. 2 steps
 * Example 2:
 *
 * Input: n = 3
 * Output: 3
 * Explanation: There are three ways to climb to the top.
 * 1. 1 step + 1 step + 1 step
 * 2. 1 step + 2 steps
 * 3. 2 steps + 1 step
 *
 *
 * Constraints:
 *
 * 1 <= n <= 45
 * @see <a href="https://leetcode.com/problems/climbing-stairs/">LeetCode</a>
 */
fun climbStairs(n: Int): Int {
    return when (n) {
        1 -> 1
        2 -> 2
        else -> waysToClimbStairs(n)
    }
}

private fun waysToClimbStairs(n: Int): Int {
    val array = IntArray(n)
    array[0] = 1
    array[1] = 2
    for (index in 2..n - 1) {
        array[index] = array[index - 1] + array[index - 2]
    }
    return array[n - 1]
}
