mirror of
https://github.com/arkorty/LeetCode.git
synced 2026-03-18 00:57:17 +00:00
Add solution to 'a lot' of problems
This commit is contained in:
17
Easy/climbing-stairs/solution.cpp
Normal file
17
Easy/climbing-stairs/solution.cpp
Normal file
@@ -0,0 +1,17 @@
|
||||
#include <vector>
|
||||
|
||||
class Solution {
|
||||
public:
|
||||
int climbStairs(int n) {
|
||||
if (n == 0) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
std::vector<int> shiftTwoFibo{1, 2};
|
||||
for (int i = 2; i < n; ++i) {
|
||||
shiftTwoFibo.push_back(shiftTwoFibo[i - 1] + shiftTwoFibo[i - 2]);
|
||||
}
|
||||
|
||||
return shiftTwoFibo[n - 1];
|
||||
}
|
||||
};
|
||||
Reference in New Issue
Block a user