g0001_0100.s0070_climbing_stairs.solution.go Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

package 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 #Big_O_Time_O(n)_Space_O(n)
// #2024_03_14_Time_0_ms_(100.00%)_Space_2_MB_(50.58%)

func climbStairs(n int) int {
	f := make([]int, n+1)
	f[0] = 1
	f[1] = 2
	if n > 2 {
		for i := 2; i < n; i++ {
			f[i] = f[i-1] + f[i-2]
		}
	}
	return f[n-1]
}