diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/climbing_stairs.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/climbing_stairs.cpp')
-rw-r--r-- | other/climbing_stairs.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/climbing_stairs.cpp b/other/climbing_stairs.cpp deleted file mode 100644 index afc3d7e..0000000 --- a/other/climbing_stairs.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#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); -} |