We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e3c39de commit 63319b7Copy full SHA for 63319b7
dynamic_programming/factorial_top_down_dp.cpp
@@ -15,7 +15,7 @@
15
#include <cassert> // For test cases
16
17
/// Array to store computed factorials for memoization
18
-long long memo[1000] = {0};
+std::array<uint64_t, 1000> memo{0};
19
20
/**
21
* @brief Computes the factorial of a non-negative integer using recursion and memoization.
0 commit comments