T(n) = 1 + 2 + 4 + 8 + ... + 2n - 1 => O(2n)void allFib(int n) { int[] memo = new int[n + 1]; for(int i = 0; i < n; ...
確定! 回上一頁