<\/span><\/h2>\n\n\n\n\/\/ Time complexity = O(2^n)\nfunction fib(n) {\n if (n < 2) {\n return n;\n }\n return fib(n - 1) + fib(n - 2);\n}\n\nfib(10)\n\/\/ 55\nfib(6)\n\/\/ 8<\/code><\/pre>\n\n\n\n<\/span>2. JavaScript \u8cbb\u6c0f\u6578\u5217 – \u8ff4\u5708\u89e3<\/span><\/h2>\n\n\n\n\/\/ Time Complexity = O(n)\nfunction fib(n) {\n const arr = [0, 1];\n for (let i = 2; i <= n; i++) {\n arr[i] = arr[i - 1] + arr[i - 2];\n }\n return arr[n];\n}\n\nfib(10)\n\/\/ 55\nfib(6)\n\/\/ 8<\/code><\/pre>\n\n\n\n<\/span>3. JavaScript \u8cbb\u6c0f\u6578\u5217 – Memoization<\/span><\/h2>\n\n\n\n\/\/ Time Complexity = O(n)\n\/\/ \u597d\u7406\u89e3\u7684\u7248\u672c\nfunction fib(n) {\n if (!fib.cache) {\n fib.cache = {\n 0: 0,\n 1: 1\n };\n }\n if (fib.cache[n] !== undefined) {\n return fib.cache[n];\n }\n fib.cache[n] = fib(n - 1) + fib(n - 2);\n return fib.cache[n];\n}\n\n\/\/ \u5176\u4ed6\u51fd\u6578\u901a\u7528\u7248\nfunction memoize(fn) {\n const cache = {};\n return function(...args) {\n if (cache[args]) {\n return cache[args];\n }\n const result = fn.apply(this, args);\n cache[args] = result;\n return result;\n }\n}\n\nfunction fib(n) {\n if (n < 2) {\n return n;\n }\n return fib(n - 1) + fib(n - 2);\n}\n\nfib = memoize(fib);\n\nfib(10)\n\/\/ 55\nfib(6)\n\/\/ 8<\/code><\/pre>\n\n\n\n\n\n\u5982\u679c\u89ba\u5f97\u6211\u7684\u6587\u7ae0\u6709\u5e6b\u52a9\u7684\u8a71\uff0c\u6b61\u8fce\u5e6b\u6211\u7684\u7c89\u5c08\u6309\u8b9a\u54e6~\u8b1d\u8b1d\u4f60\uff01
<\/p>\n\n