• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.8
• source code
• Solution.kt

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0001_0100.s0070_climbing_stairs.Solution.kt Maven / Gradle / Ivy

package g0001_0100.s0070_climbing_stairs

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming
// #2022_08_30_Time_127_ms_(97.06%)_Space_32.7_MB_(97.70%)

class Solution {
    fun climbStairs(n: Int): Int {
        if (n < 2) {
            return n
        }
        val cache = IntArray(n)
        // creating a cache or DP to store the result
        // so that we dont have to iterate multiple times
        // for the same values;

        // for 0 and 1 the result array i.e cache values would be 1 and 2
        // in loop we are just getting ith values i.e 5th step values from
        // i-1 and i-2 which are 4th step and 3rd step values.
        cache[0] = 1
        cache[1] = 2
        for (i in 2 until n) {
            cache[i] = cache[i - 1] + cache[i - 2]
        }
        return cache[n - 1]
    }
}