constexpr int MAX_N = 50;
vector<size_t> res(MAX_N + 1);
template<size_t N>
struct AA {
static constexpr size_t value = AA<N - 1>::value + AA<N - 2>::value;
AA() {
AA<N - 1> temp;
res[N] = value;
}
};
template<>
struct AA<0> {
static constexpr size_t value = 1;
AA() {
res[0] = 1;
}
};
template<>
struct AA<1> {
static constexpr size_t value = 1;
AA() {
AA<0> temp;
res[1] = 1;
}
};
AA<MAX_N> aa;
class Solution{
public:
int climbStairs(int n) {
return res[n];
}
};
c++ 斐波那契数列不一样的解法(O(1))(爬楼梯问题)
最新推荐文章于 2022-11-15 11:33:15 发布