(num)
| 78 | // @Satzyakiz |
| 79 | |
| 80 | const FibonacciDpWithoutRecursion = (num) => { |
| 81 | const isNeg = num < 0 |
| 82 | if (isNeg) num *= -1 |
| 83 | const table = [0] |
| 84 | table.push(1) |
| 85 | table.push(isNeg ? -1 : 1) |
| 86 | for (let i = 2; i < num; ++i) { |
| 87 | table.push(isNeg ? table[i - 1] - table[i] : table[i] + table[i - 1]) |
| 88 | } |
| 89 | return table |
| 90 | } |
| 91 | |
| 92 | // Using Matrix exponentiation to find n-th fibonacci in O(log n) time |
| 93 |