斐波那契数列的Rust解法(递归和非递归)

递归解法web fn fib(n:i32) -> i32{ if(n < 0){ panic!("input can not be less than zero!"); } else if(n == 1 || n == 2){ 1 } else{ return fib(n - 1) + fib(n - 2);

>>阅读原文<<