We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
int fib(int n){ if(n < 2) return n; return fib(n-1) + fib(n-2); }
int fib(int n){ int n_1 = 0, n_2 = 1; int tmp; for(int i = 2; i < n; i++){ tmp = n_1; n_1 = n_2; n_2 += tmp; } }
M ^ N 的优化
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Reference
Brief
Algos
递归法
递推法
递推式
M ^ N 的优化
The text was updated successfully, but these errors were encountered: