{"id":1104798,"date":"2025-01-08T16:24:23","date_gmt":"2025-01-08T08:24:23","guid":{"rendered":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/1104798.html"},"modified":"2025-01-08T16:24:27","modified_gmt":"2025-01-08T08:24:27","slug":"%e5%a6%82%e4%bd%95%e7%94%a8python%e6%b1%82%e6%96%90%e6%b3%a2%e9%82%a3%e5%a5%91%e6%95%b0%e5%88%97","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/1104798.html","title":{"rendered":"\u5982\u4f55\u7528python\u6c42\u6590\u6ce2\u90a3\u5951\u6570\u5217"},"content":{"rendered":"<p style=\"text-align:center;\" ><img decoding=\"async\" src=\"https:\/\/cdn-kb.worktile.com\/kb\/wp-content\/uploads\/2024\/04\/25070012\/db2dea24-4ad7-43f0-a823-2fa5584543bb.webp\" alt=\"\u5982\u4f55\u7528python\u6c42\u6590\u6ce2\u90a3\u5951\u6570\u5217\" \/><\/p>\n<p><p> <strong>\u7528Python\u6c42\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u5e38\u7528\u65b9\u6cd5\u6709\u9012\u5f52\u3001\u8fed\u4ee3\u548c\u52a8\u6001\u89c4\u5212\u3002<\/strong> \u5176\u4e2d\uff0c\u9012\u5f52\u65b9\u6cd5\u867d\u7136\u76f4\u89c2\uff0c\u4f46\u6548\u7387\u8f83\u4f4e\uff1b\u8fed\u4ee3\u65b9\u6cd5\u76f8\u5bf9\u9ad8\u6548\u4e14\u6613\u4e8e\u7406\u89e3\uff1b\u52a8\u6001\u89c4\u5212\u65b9\u6cd5\u5229\u7528\u7f13\u5b58\u6280\u672f\uff0c\u8fdb\u4e00\u6b65\u63d0\u5347\u4e86\u8ba1\u7b97\u6548\u7387\u3002\u4e0b\u9762\u5c06\u8be6\u7ec6\u4ecb\u7ecd\u8fd9\u51e0\u79cd\u65b9\u6cd5\uff0c\u5e76\u7ed9\u51fa\u793a\u4f8b\u4ee3\u7801\u3002<\/p>\n<\/p>\n<p><p>\u4e00\u3001\u9012\u5f52\u65b9\u6cd5<\/p>\n<\/p>\n<p><p>\u9012\u5f52\u65b9\u6cd5\u662f\u6700\u76f4\u89c2\u7684\u5b9e\u73b0\u65b9\u5f0f\uff0c\u901a\u8fc7\u51fd\u6570\u81ea\u8eab\u8c03\u7528\u6765\u8ba1\u7b97\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u5b9a\u4e49\u662f\uff1aF(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2) (n &gt;= 2)\u3002<\/p>\n<\/p>\n<p><pre><code class=\"language-python\">def fibonacci_recursive(n):<\/p>\n<p>    if n &lt;= 0:<\/p>\n<p>        return 0<\/p>\n<p>    elif n == 1:<\/p>\n<p>        return 1<\/p>\n<p>    else:<\/p>\n<p>        return fibonacci_recursive(n-1) + fibonacci_recursive(n-2)<\/p>\n<h2><strong>\u6d4b\u8bd5\u9012\u5f52\u65b9\u6cd5<\/strong><\/h2>\n<p>for i in range(10):<\/p>\n<p>    print(fibonacci_recursive(i))<\/p>\n<p><\/code><\/pre>\n<\/p>\n<p><p>\u9012\u5f52\u65b9\u6cd5\u7684\u4f18\u70b9\u5728\u4e8e\u4ee3\u7801\u7b80\u6d01\u3001\u601d\u8def\u6e05\u6670\uff0c\u4f46\u7f3a\u70b9\u662f\u5f53n\u8f83\u5927\u65f6\uff0c\u8ba1\u7b97\u91cf\u4f1a\u6025\u5267\u589e\u52a0\uff0c\u5bfc\u81f4\u7a0b\u5e8f\u8fd0\u884c\u7f13\u6162\uff0c\u751a\u81f3\u53ef\u80fd\u51fa\u73b0\u6808\u6ea2\u51fa\u9519\u8bef\u3002<\/p>\n<\/p>\n<p><p>\u4e8c\u3001\u8fed\u4ee3\u65b9\u6cd5<\/p>\n<\/p>\n<p><p>\u8fed\u4ee3\u65b9\u6cd5\u901a\u8fc7\u5faa\u73af\u6765\u8ba1\u7b97\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u5404\u9879\u503c\u3002\u76f8\u5bf9\u4e8e\u9012\u5f52\u65b9\u6cd5\uff0c\u8fed\u4ee3\u65b9\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u548c\u7a7a\u95f4\u590d\u6742\u5ea6\u90fd\u66f4\u4f4e\uff0c\u9002\u7528\u4e8e\u8ba1\u7b97\u8f83\u5927\u89c4\u6a21\u7684\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002<\/p>\n<\/p>\n<p><pre><code class=\"language-python\">def fibonacci_iterative(n):<\/p>\n<p>    if n &lt;= 0:<\/p>\n<p>        return 0<\/p>\n<p>    elif n == 1:<\/p>\n<p>        return 1<\/p>\n<p>    a, b = 0, 1<\/p>\n<p>    for _ in range(2, n + 1):<\/p>\n<p>        a, b = b, a + b<\/p>\n<p>    return b<\/p>\n<h2><strong>\u6d4b\u8bd5\u8fed\u4ee3\u65b9\u6cd5<\/strong><\/h2>\n<p>for i in range(10):<\/p>\n<p>    print(fibonacci_iterative(i))<\/p>\n<p><\/code><\/pre>\n<\/p>\n<p><p>\u5728\u8fed\u4ee3\u65b9\u6cd5\u4e2d\uff0c\u6211\u4eec\u901a\u8fc7\u4e24\u4e2a\u53d8\u91cf\u6765\u5b58\u50a8\u524d\u4e24\u9879\u7684\u503c\uff0c\u9010\u6b65\u8ba1\u7b97\u51fa\u540e\u7eed\u7684\u6590\u6ce2\u90a3\u5951\u6570\uff0c\u4ece\u800c\u6709\u6548\u907f\u514d\u4e86\u9012\u5f52\u65b9\u6cd5\u4e2d\u7684\u91cd\u590d\u8ba1\u7b97\u95ee\u9898\u3002<\/p>\n<\/p>\n<p><p>\u4e09\u3001\u52a8\u6001\u89c4\u5212\u65b9\u6cd5<\/p>\n<\/p>\n<p><p>\u52a8\u6001\u89c4\u5212\u65b9\u6cd5\u901a\u8fc7\u7f13\u5b58\uff08\u6216\u79f0\u4e3a\u8bb0\u5fc6\u5316\uff09\u6280\u672f\u6765\u4f18\u5316\u9012\u5f52\u65b9\u6cd5\u7684\u8ba1\u7b97\u6548\u7387\u3002\u6211\u4eec\u4f7f\u7528\u4e00\u4e2a\u6570\u7ec4\u6765\u5b58\u50a8\u5df2\u7ecf\u8ba1\u7b97\u8fc7\u7684\u6590\u6ce2\u90a3\u5951\u6570\uff0c\u4ece\u800c\u907f\u514d\u91cd\u590d\u8ba1\u7b97\u3002<\/p>\n<\/p>\n<p><pre><code class=\"language-python\">def fibonacci_dynamic(n):<\/p>\n<p>    if n &lt;= 0:<\/p>\n<p>        return 0<\/p>\n<p>    elif n == 1:<\/p>\n<p>        return 1<\/p>\n<p>    fib = [0] * (n + 1)<\/p>\n<p>    fib[1] = 1<\/p>\n<p>    for i in range(2, n + 1):<\/p>\n<p>        fib[i] = fib[i - 1] + fib[i - 2]<\/p>\n<p>    return fib[n]<\/p>\n<h2><strong>\u6d4b\u8bd5\u52a8\u6001\u89c4\u5212\u65b9\u6cd5<\/strong><\/h2>\n<p>for i in range(10):<\/p>\n<p>    print(fibonacci_dynamic(i))<\/p>\n<p><\/code><\/pre>\n<\/p>\n<p><p>\u52a8\u6001\u89c4\u5212\u65b9\u6cd5\u901a\u8fc7\u9884\u5148\u5b58\u50a8\u8ba1\u7b97\u7ed3\u679c\uff0c\u6781\u5927\u5730\u63d0\u9ad8\u4e86\u8ba1\u7b97\u6548\u7387\u3002\u5176\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(n)\uff0c\u7a7a\u95f4\u590d\u6742\u5ea6\u4e3aO(n)\uff0c\u9002\u7528\u4e8e\u8ba1\u7b97\u5927\u89c4\u6a21\u7684\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002<\/p>\n<\/p>\n<p><p>\u56db\u3001\u77e9\u9635\u5feb\u901f\u5e42\u65b9\u6cd5<\/p>\n<\/p>\n<p><p>\u77e9\u9635\u5feb\u901f\u5e42\u65b9\u6cd5\u5229\u7528\u77e9\u9635\u4e58\u6cd5\u7684\u6027\u8d28\u6765\u8ba1\u7b97\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002\u8be5\u65b9\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(log n)\uff0c\u5728\u5904\u7406\u5927\u89c4\u6a21\u8ba1\u7b97\u65f6\u5177\u6709\u660e\u663e\u4f18\u52bf\u3002<\/p>\n<\/p>\n<p><pre><code class=\"language-python\">import numpy as np<\/p>\n<p>def fibonacci_matrix(n):<\/p>\n<p>    def matrix_mult(A, B):<\/p>\n<p>        return np.dot(A, B).tolist()<\/p>\n<p>    def matrix_pow(matrix, power):<\/p>\n<p>        result = [[1, 0], [0, 1]]<\/p>\n<p>        while power:<\/p>\n<p>            if power % 2 == 1:<\/p>\n<p>                result = matrix_mult(result, matrix)<\/p>\n<p>            matrix = matrix_mult(matrix, matrix)<\/p>\n<p>            power \/\/= 2<\/p>\n<p>        return result<\/p>\n<p>    F = [[1, 1], [1, 0]]<\/p>\n<p>    if n == 0:<\/p>\n<p>        return 0<\/p>\n<p>    result = matrix_pow(F, n - 1)<\/p>\n<p>    return result[0][0]<\/p>\n<h2><strong>\u6d4b\u8bd5\u77e9\u9635\u5feb\u901f\u5e42\u65b9\u6cd5<\/strong><\/h2>\n<p>for i in range(10):<\/p>\n<p>    print(fibonacci_matrix(i))<\/p>\n<p><\/code><\/pre>\n<\/p>\n<p><p>\u77e9\u9635\u5feb\u901f\u5e42\u65b9\u6cd5\u901a\u8fc7\u77e9\u9635\u4e58\u6cd5\u548c\u5e42\u8fd0\u7b97\uff0c\u80fd\u591f\u5728\u5bf9\u6570\u65f6\u95f4\u5185\u8ba1\u7b97\u51fa\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u7b2cn\u9879\uff0c\u975e\u5e38\u9002\u5408\u9700\u8981\u9ad8\u6548\u8ba1\u7b97\u7684\u573a\u666f\u3002<\/p>\n<\/p>\n<p><p>\u4e94\u3001\u751f\u6210\u5668\u65b9\u6cd5<\/p>\n<\/p>\n<p><p>\u751f\u6210\u5668\u65b9\u6cd5\u5229\u7528Python\u751f\u6210\u5668\u7684\u7279\u6027\uff0c\u80fd\u591f\u5728\u9700\u8981\u65f6\u9010\u9879\u751f\u6210\u6590\u6ce2\u90a3\u5951\u6570\u5217\uff0c\u800c\u4e0d\u9700\u8981\u4e00\u6b21\u6027\u8ba1\u7b97\u51fa\u6240\u6709\u7684\u9879\u3002\u751f\u6210\u5668\u65b9\u6cd5\u5728\u5185\u5b58\u4f7f\u7528\u4e0a\u975e\u5e38\u9ad8\u6548\u3002<\/p>\n<\/p>\n<p><pre><code class=\"language-python\">def fibonacci_generator():<\/p>\n<p>    a, b = 0, 1<\/p>\n<p>    while True:<\/p>\n<p>        yield a<\/p>\n<p>        a, b = b, a + b<\/p>\n<h2><strong>\u6d4b\u8bd5\u751f\u6210\u5668\u65b9\u6cd5<\/strong><\/h2>\n<p>gen = fibonacci_generator()<\/p>\n<p>for _ in range(10):<\/p>\n<p>    print(next(gen))<\/p>\n<p><\/code><\/pre>\n<\/p>\n<p><p>\u751f\u6210\u5668\u65b9\u6cd5\u901a\u8fc7<code>yield<\/code>\u8bed\u53e5\uff0c\u6bcf\u6b21\u8c03\u7528\u65f6\u8fd4\u56de\u5f53\u524d\u7684\u6590\u6ce2\u90a3\u5951\u6570\uff0c\u5e76\u8ba1\u7b97\u51fa\u4e0b\u4e00\u4e2a\u6570\u7684\u503c\u3002\u8fd9\u6837\u7684\u65b9\u6cd5\u5728\u5904\u7406\u5927\u6570\u636e\u91cf\u65f6\uff0c\u80fd\u591f\u663e\u8457\u964d\u4f4e\u5185\u5b58\u6d88\u8017\u3002<\/p>\n<\/p>\n<p><p>\u603b\u7ed3<\/p>\n<\/p>\n<p><p>\u901a\u8fc7\u4e0a\u8ff0\u51e0\u79cd\u65b9\u6cd5\uff0c\u6211\u4eec\u53ef\u4ee5\u9ad8\u6548\u5730\u8ba1\u7b97\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002\u9012\u5f52\u65b9\u6cd5\u9002\u5408\u5c0f\u89c4\u6a21\u8ba1\u7b97\uff0c\u8fed\u4ee3\u65b9\u6cd5\u548c\u52a8\u6001\u89c4\u5212\u65b9\u6cd5\u9002\u7528\u4e8e\u4e2d\u7b49\u89c4\u6a21\u8ba1\u7b97\uff0c\u800c\u77e9\u9635\u5feb\u901f\u5e42\u65b9\u6cd5\u548c\u751f\u6210\u5668\u65b9\u6cd5\u5219\u9002\u5408\u9700\u8981\u9ad8\u6548\u8ba1\u7b97\u548c\u5904\u7406\u5927\u6570\u636e\u91cf\u7684\u573a\u666f\u3002\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\uff0c\u53ef\u4ee5\u6839\u636e\u5177\u4f53\u9700\u6c42\u9009\u62e9\u5408\u9002\u7684\u65b9\u6cd5\u6765\u8ba1\u7b97\u6590\u6ce2\u90a3\u5951\u6570\u5217\u3002<\/p>\n<\/p>\n<h2><strong>\u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n<p> <strong>Python\u4e2d\u5982\u4f55\u5b9e\u73b0\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u8ba1\u7b97\uff1f<\/strong><br \/>\u5728Python\u4e2d\uff0c\u6c42\u6590\u6ce2\u90a3\u5951\u6570\u5217\u53ef\u4ee5\u901a\u8fc7\u591a\u79cd\u65b9\u6cd5\u5b9e\u73b0\uff0c\u5305\u62ec\u9012\u5f52\u3001\u8fed\u4ee3\u548c\u52a8\u6001\u89c4\u5212\u3002\u9012\u5f52\u65b9\u6cd5\u7b80\u5355\u6613\u61c2\uff0c\u4f46\u6548\u7387\u8f83\u4f4e\uff0c\u9002\u5408\u4e8e\u5c0f\u89c4\u6a21\u7684\u8ba1\u7b97\uff1b\u8fed\u4ee3\u65b9\u6cd5\u5219\u66f4\u52a0\u9ad8\u6548\uff0c\u9002\u7528\u4e8e\u8f83\u5927\u7684\u6570\u5217\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u7b80\u5355\u7684\u8fed\u4ee3\u5b9e\u73b0\u793a\u4f8b\uff1a<\/p>\n<pre><code class=\"language-python\">def fibonacci(n):\n    a, b = 0, 1\n    for _ in range(n):\n        a, b = b, a + b\n    return a\n\nprint(fibonacci(10))  # \u8f93\u51fa\u7b2c10\u4e2a\u6590\u6ce2\u90a3\u5951\u6570\n<\/code><\/pre>\n<p><strong>\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u5e94\u7528\u573a\u666f\u6709\u54ea\u4e9b\uff1f<\/strong><br \/>\u6590\u6ce2\u90a3\u5951\u6570\u5217\u5728\u8ba1\u7b97\u673a\u79d1\u5b66\u548c\u6570\u5b66\u4e2d\u6709\u5e7f\u6cdb\u7684\u5e94\u7528\u3002\u4f8b\u5982\uff0c\u5b83\u7528\u4e8e\u7b97\u6cd5\u8bbe\u8ba1\u4e2d\u7684\u52a8\u6001\u89c4\u5212\u3001\u6570\u636e\u7ed3\u6784\u4e2d\u7684\u6811\u5f62\u7ed3\u6784\u3001\u91d1\u878d\u5e02\u573a\u7684\u6280\u672f\u5206\u6790\u3001\u4ee5\u53ca\u81ea\u7136\u754c\u4e2d\u7684\u751f\u7269\u6a21\u578b\u7b49\u3002\u4e86\u89e3\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u7279\u6027\uff0c\u53ef\u4ee5\u5e2e\u52a9\u6211\u4eec\u66f4\u597d\u5730\u89e3\u51b3\u590d\u6742\u95ee\u9898\u3002<\/p>\n<p><strong>\u5982\u4f55\u4f18\u5316\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u8ba1\u7b97\u6027\u80fd\uff1f<\/strong><br \/>\u4e3a\u4e86\u63d0\u9ad8\u8ba1\u7b97\u6027\u80fd\uff0c\u53ef\u4ee5\u4f7f\u7528\u8bb0\u5fc6\u5316\u9012\u5f52\u6216\u8005\u52a8\u6001\u89c4\u5212\u6765\u907f\u514d\u91cd\u590d\u8ba1\u7b97\u3002\u8bb0\u5fc6\u5316\u65b9\u6cd5\u5c06\u5df2\u7ecf\u8ba1\u7b97\u8fc7\u7684\u6590\u6ce2\u90a3\u5951\u6570\u5b58\u50a8\u5728\u4e00\u4e2a\u6570\u7ec4\u4e2d\uff0c\u540e\u7eed\u8ba1\u7b97\u65f6\u76f4\u63a5\u67e5\u627e\uff0c\u4ece\u800c\u663e\u8457\u63d0\u9ad8\u6548\u7387\u3002\u4ee5\u4e0b\u662f\u8bb0\u5fc6\u5316\u9012\u5f52\u7684\u793a\u4f8b\u4ee3\u7801\uff1a<\/p>\n<pre><code class=\"language-python\">def fibonacci_memo(n, memo={}):\n    if n in memo:\n        return memo[n]\n    if n &lt;= 1:\n        return n\n    memo[n] = fibonacci_memo(n - 1, memo) + fibonacci_memo(n - 2, memo)\n    return memo[n]\n\nprint(fibonacci_memo(10))  # \u8f93\u51fa\u7b2c10\u4e2a\u6590\u6ce2\u90a3\u5951\u6570\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u7528Python\u6c42\u6590\u6ce2\u90a3\u5951\u6570\u5217\u7684\u5e38\u7528\u65b9\u6cd5\u6709\u9012\u5f52\u3001\u8fed\u4ee3\u548c\u52a8\u6001\u89c4\u5212\u3002 \u5176\u4e2d\uff0c\u9012\u5f52\u65b9\u6cd5\u867d\u7136\u76f4\u89c2\uff0c\u4f46\u6548\u7387\u8f83\u4f4e\uff1b\u8fed\u4ee3\u65b9\u6cd5\u76f8 [&hellip;]","protected":false},"author":3,"featured_media":1104810,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[37],"tags":[],"acf":[],"_links":{"self":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1104798"}],"collection":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/comments?post=1104798"}],"version-history":[{"count":"1","href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1104798\/revisions"}],"predecessor-version":[{"id":1104814,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1104798\/revisions\/1104814"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/1104810"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=1104798"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=1104798"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=1104798"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}