diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/climbing_stairs.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
Diffstat (limited to 'other/climbing_stairs.cpp')
-rw-r--r-- | other/climbing_stairs.cpp | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/other/climbing_stairs.cpp b/other/climbing_stairs.cpp new file mode 100644 index 0000000..afc3d7e --- /dev/null +++ b/other/climbing_stairs.cpp @@ -0,0 +1,31 @@ +#include "leetcode.h" + +class Solution { +public: + int climbStairs(int n) { + /* + * base case + * because if 0 steps -> 0 ways, + * 1 step -> 1 way, & 2 step -> 2 ways + */ + if (n <= 2) + return n; + /* + * last step was either: + * 1 step (oneStep) or 2 steps (twoStep) + * so simply add the two values (fibonacci sequence) + */ + int oneStep = 1, twoStep = 2, ans; + for (int i = 3; i <= n; i++) { // 0-2 steps already determined + ans = oneStep + twoStep; + oneStep = twoStep; + twoStep = ans; + } + return ans; + } +}; + +int main() { + Solution obj; + cout << obj.climbStairs(4); +} |