(n: i32)
| 14 | // 动态规划 |
| 15 | impl Solution { |
| 16 | pub fn tribonacci(n: i32) -> i32 { |
| 17 | let mut ret = vec![0; 38]; |
| 18 | ret[0] = 0; |
| 19 | ret[1] = 1; |
| 20 | ret[2] = 1; |
| 21 | for i in 3..38 { |
| 22 | ret[i] = ret[i-1] + ret[i-2] + ret[i-3]; |
| 23 | } |
| 24 | ret[n as usize] |
| 25 | } |
| 26 | } |
| 27 | |
| 28 | fn main() { |
nothing calls this directly
no outgoing calls
no test coverage detected