{"id":1167275,"date":"2025-01-15T15:42:31","date_gmt":"2025-01-15T07:42:31","guid":{"rendered":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/1167275.html"},"modified":"2025-01-15T15:42:33","modified_gmt":"2025-01-15T07:42:33","slug":"%e5%a6%82%e4%bd%95%e6%b1%82%e5%a5%87%e6%95%b0%e9%98%b6%e4%b9%98%e4%b9%8b%e5%92%8cpython","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/1167275.html","title":{"rendered":"\u5982\u4f55\u6c42\u5947\u6570\u9636\u4e58\u4e4b\u548cpython"},"content":{"rendered":"

\"\u5982\u4f55\u6c42\u5947\u6570\u9636\u4e58\u4e4b\u548cpython\"<\/p>\n

\u5728Python\u4e2d\uff0c\u6c42\u5947\u6570\u9636\u4e58\u4e4b\u548c\u7684\u65b9\u6cd5\u6709\u591a\u79cd\uff0c\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u3001\u9012\u5f52\u7b49\u65b9\u5f0f\u3002<\/strong><\/p>\n<\/p>\n

\u4e00\u79cd\u5e38\u89c1\u7684\u65b9\u5f0f\u662f\u4f7f\u7528\u5faa\u73af\u904d\u5386\u6240\u6709\u5947\u6570\uff0c\u5e76\u8ba1\u7b97\u5b83\u4eec\u7684\u9636\u4e58\u7136\u540e\u6c42\u548c\uff0c\u53e6\u4e00\u79cd\u65b9\u5f0f\u662f\u4f7f\u7528\u9012\u5f52\u6765\u8ba1\u7b97\u6bcf\u4e2a\u5947\u6570\u7684\u9636\u4e58\u3002<\/strong><\/p>\n<\/p>\n

\u4e0b\u9762\u6211\u5c06\u8be6\u7ec6\u8bb2\u89e3\u5982\u4f55\u4f7f\u7528\u5faa\u73af\u548c\u9012\u5f52\u6765\u6c42\u89e3\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002<\/p>\n<\/p>\n

\u4e00\u3001\u5faa\u73af\u6cd5<\/strong><\/h2>\n

\u5faa\u73af\u6cd5\u662f\u901a\u8fc7\u904d\u5386\u6240\u6709\u5947\u6570\uff0c\u8ba1\u7b97\u6bcf\u4e2a\u5947\u6570\u7684\u9636\u4e58\u5e76\u7d2f\u52a0\u6c42\u548c\u3002\u4ee5\u4e0b\u662f\u5177\u4f53\u6b65\u9aa4\u548c\u4ee3\u7801\u5b9e\u73b0\uff1a<\/p>\n<\/p>\n

1\u3001\u5b9a\u4e49\u9636\u4e58\u51fd\u6570<\/h2>\n<\/p>\n

\u9996\u5148\uff0c\u6211\u4eec\u9700\u8981\u5b9a\u4e49\u4e00\u4e2a\u51fd\u6570\u6765\u8ba1\u7b97\u7ed9\u5b9a\u6570\u7684\u9636\u4e58\u3002\u9636\u4e58\u7684\u5b9a\u4e49\u662f\u4ece1\u4e58\u5230\u8fd9\u4e2a\u6570\uff0c\u6bd4\u59825\u7684\u9636\u4e58\u662f1\u00d72\u00d73\u00d74\u00d75\u3002<\/p>\n<\/p>\n

def factorial(n):<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        return 1<\/p>\n
    result = 1<\/p>\n
    for i in range(2, n + 1):<\/p>\n
        result *= i<\/p>\n
    return result<\/p>\n
<\/code><\/pre>\n<\/p>\n
2\u3001\u6c42\u548c\u51fd\u6570<\/h2>\n<\/p>\n
\u63a5\u4e0b\u6765\uff0c\u5b9a\u4e49\u4e00\u4e2a\u51fd\u6570\u6765\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002\u8fd9\u4e2a\u51fd\u6570\u63a5\u53d7\u4e00\u4e2a\u53c2\u6570limit<\/code>\uff0c\u8868\u793a\u8ba1\u7b97\u4ece1\u5230limit<\/code>\u8303\u56f4\u5185\u7684\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002<\/p>\n<\/p>\n
def sum_of_odd_factorials(limit):<\/p>\n
    total_sum = 0<\/p>\n
    for i in range(1, limit + 1, 2):<\/p>\n
        total_sum += factorial(i)<\/p>\n
    return total_sum<\/p>\n
<\/code><\/pre>\n<\/p>\n
3\u3001\u4e3b\u7a0b\u5e8f<\/h2>\n<\/p>\n
\u6700\u540e\uff0c\u6211\u4eec\u53ef\u4ee5\u5728\u4e3b\u7a0b\u5e8f\u4e2d\u8c03\u7528\u8fd9\u4e9b\u51fd\u6570\uff0c\u5e76\u8f93\u51fa\u7ed3\u679c\u3002<\/p>\n<\/p>\n
if __name__ == "__mAI<\/a>n__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5b8c\u6574\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n<\/p>\n
def factorial(n):<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        return 1<\/p>\n
    result = 1<\/p>\n
    for i in range(2, n + 1):<\/p>\n
        result *= i<\/p>\n
    return result<\/p>\n
def sum_of_odd_factorials(limit):<\/p>\n
    total_sum = 0<\/p>\n
    for i in range(1, limit + 1, 2):<\/p>\n
        total_sum += factorial(i)<\/p>\n
    return total_sum<\/p>\n
if __name__ == "__main__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e8c\u3001\u9012\u5f52\u6cd5<\/strong><\/h2>\n
\u9012\u5f52\u6cd5\u662f\u901a\u8fc7\u9012\u5f52\u8c03\u7528\u51fd\u6570\u6765\u8ba1\u7b97\u5947\u6570\u7684\u9636\u4e58\u5e76\u7d2f\u52a0\u6c42\u548c\u3002\u4ee5\u4e0b\u662f\u5177\u4f53\u6b65\u9aa4\u548c\u4ee3\u7801\u5b9e\u73b0\uff1a<\/p>\n<\/p>\n
1\u3001\u5b9a\u4e49\u9012\u5f52\u9636\u4e58\u51fd\u6570<\/h2>\n<\/p>\n
\u9996\u5148\uff0c\u5b9a\u4e49\u4e00\u4e2a\u9012\u5f52\u51fd\u6570\u6765\u8ba1\u7b97\u7ed9\u5b9a\u6570\u7684\u9636\u4e58\u3002<\/p>\n<\/p>\n
def factorial_recursive(n):<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        return 1<\/p>\n
    else:<\/p>\n
        return n * factorial_recursive(n - 1)<\/p>\n
<\/code><\/pre>\n<\/p>\n
2\u3001\u9012\u5f52\u6c42\u548c\u51fd\u6570<\/h2>\n<\/p>\n
\u63a5\u4e0b\u6765\uff0c\u5b9a\u4e49\u4e00\u4e2a\u9012\u5f52\u51fd\u6570\u6765\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002<\/p>\n<\/p>\n
def sum_of_odd_factorials_recursive(n):<\/p>\n
    if n <= 0:<\/p>\n
        return 0<\/p>\n
    if n % 2 == 0:<\/p>\n
        return sum_of_odd_factorials_recursive(n - 1)<\/p>\n
    else:<\/p>\n
        return factorial_recursive(n) + sum_of_odd_factorials_recursive(n - 2)<\/p>\n
<\/code><\/pre>\n<\/p>\n
3\u3001\u4e3b\u7a0b\u5e8f<\/h2>\n<\/p>\n
\u6700\u540e\uff0c\u5728\u4e3b\u7a0b\u5e8f\u4e2d\u8c03\u7528\u8fd9\u4e9b\u51fd\u6570\u5e76\u8f93\u51fa\u7ed3\u679c\u3002<\/p>\n<\/p>\n
if __name__ == "__main__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials_recursive(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5b8c\u6574\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n<\/p>\n
def factorial_recursive(n):<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        return 1<\/p>\n
    else:<\/p>\n
        return n * factorial_recursive(n - 1)<\/p>\n
def sum_of_odd_factorials_recursive(n):<\/p>\n
    if n <= 0:<\/p>\n
        return 0<\/p>\n
    if n % 2 == 0:<\/p>\n
        return sum_of_odd_factorials_recursive(n - 1)<\/p>\n
    else:<\/p>\n
        return factorial_recursive(n) + sum_of_odd_factorials_recursive(n - 2)<\/p>\n
if __name__ == "__main__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials_recursive(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e09\u3001\u6027\u80fd\u4f18\u5316<\/strong><\/h2>\n
\u5728\u4e0a\u8ff0\u4e24\u79cd\u65b9\u6cd5\u4e2d\uff0c\u9012\u5f52\u6cd5\u7531\u4e8e\u9891\u7e41\u7684\u51fd\u6570\u8c03\u7528\uff0c\u53ef\u80fd\u4f1a\u5bfc\u81f4\u6808\u6ea2\u51fa\u95ee\u9898\uff0c\u7279\u522b\u662f\u5728\u8ba1\u7b97\u8f83\u5927\u8303\u56f4\u7684\u5947\u6570\u9636\u4e58\u4e4b\u548c\u65f6\u3002\u56e0\u6b64\uff0c\u63a8\u8350\u4f7f\u7528\u5faa\u73af\u6cd5\u6765\u907f\u514d\u8fd9\u79cd\u95ee\u9898\u3002<\/p>\n<\/p>\n
\u6b64\u5916\uff0c\u4e3a\u4e86\u8fdb\u4e00\u6b65\u4f18\u5316\u6027\u80fd\uff0c\u53ef\u4ee5\u4f7f\u7528\u52a8\u6001\u89c4\u5212\u6216\u8005\u8bb0\u5fc6\u5316\u9012\u5f52\u7684\u65b9\u6cd5\u6765\u51cf\u5c11\u91cd\u590d\u8ba1\u7b97\u3002\u4ee5\u4e0b\u662f\u4f7f\u7528\u8bb0\u5fc6\u5316\u9012\u5f52\u7684\u65b9\u6cd5\uff1a<\/p>\n<\/p>\n
1\u3001\u5b9a\u4e49\u8bb0\u5fc6\u5316\u9636\u4e58\u51fd\u6570<\/h2>\n<\/p>\n
\u4f7f\u7528\u5b57\u5178\u6765\u5b58\u50a8\u5df2\u7ecf\u8ba1\u7b97\u8fc7\u7684\u9636\u4e58\u503c\uff0c\u4ee5\u907f\u514d\u91cd\u590d\u8ba1\u7b97\u3002<\/p>\n<\/p>\n
factorial_memo = {}<\/p>\n
def factorial_memoized(n):<\/p>\n
    if n in factorial_memo:<\/p>\n
        return factorial_memo[n]<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        factorial_memo[n] = 1<\/p>\n
    else:<\/p>\n
        factorial_memo[n] = n * factorial_memoized(n - 1)<\/p>\n
    return factorial_memo[n]<\/p>\n
<\/code><\/pre>\n<\/p>\n
2\u3001\u8bb0\u5fc6\u5316\u9012\u5f52\u6c42\u548c\u51fd\u6570<\/h2>\n<\/p>\n
\u4f7f\u7528\u8bb0\u5fc6\u5316\u9012\u5f52\u65b9\u6cd5\u6765\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002<\/p>\n<\/p>\n
def sum_of_odd_factorials_memoized(n):<\/p>\n
    if n <= 0:<\/p>\n
        return 0<\/p>\n
    if n % 2 == 0:<\/p>\n
        return sum_of_odd_factorials_memoized(n - 1)<\/p>\n
    else:<\/p>\n
        return factorial_memoized(n) + sum_of_odd_factorials_memoized(n - 2)<\/p>\n
<\/code><\/pre>\n<\/p>\n
3\u3001\u4e3b\u7a0b\u5e8f<\/h2>\n<\/p>\n
\u5728\u4e3b\u7a0b\u5e8f\u4e2d\u8c03\u7528\u8fd9\u4e9b\u51fd\u6570\u5e76\u8f93\u51fa\u7ed3\u679c\u3002<\/p>\n<\/p>\n
if __name__ == "__main__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials_memoized(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5b8c\u6574\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n<\/p>\n
factorial_memo = {}<\/p>\n
def factorial_memoized(n):<\/p>\n
    if n in factorial_memo:<\/p>\n
        return factorial_memo[n]<\/p>\n
    if n == 0 or n == 1:<\/p>\n
        factorial_memo[n] = 1<\/p>\n
    else:<\/p>\n
        factorial_memo[n] = n * factorial_memoized(n - 1)<\/p>\n
    return factorial_memo[n]<\/p>\n
def sum_of_odd_factorials_memoized(n):<\/p>\n
    if n <= 0:<\/p>\n
        return 0<\/p>\n
    if n % 2 == 0:<\/p>\n
        return sum_of_odd_factorials_memoized(n - 1)<\/p>\n
    else:<\/p>\n
        return factorial_memoized(n) + sum_of_odd_factorials_memoized(n - 2)<\/p>\n
if __name__ == "__main__":<\/p>\n
    limit = int(input("Enter the limit: "))<\/p>\n
    result = sum_of_odd_factorials_memoized(limit)<\/p>\n
    print(f"The sum of odd factorials up to {limit} is: {result}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u901a\u8fc7\u4ee5\u4e0a\u65b9\u5f0f\uff0c\u6211\u4eec\u53ef\u4ee5\u9ad8\u6548\u5730\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u4e4b\u548c\u3002\u65e0\u8bba\u662f\u4f7f\u7528\u5faa\u73af\u3001\u9012\u5f52\u8fd8\u662f\u8bb0\u5fc6\u5316\u9012\u5f52\uff0c\u90fd\u53ef\u4ee5\u6839\u636e\u5177\u4f53\u7684\u9700\u6c42\u548c\u6570\u636e\u8303\u56f4\u9009\u62e9\u5408\u9002\u7684\u65b9\u6cd5\u3002\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\uff0c\u63a8\u8350\u4f7f\u7528\u5faa\u73af\u6cd5\u6216\u8005\u8bb0\u5fc6\u5316\u9012\u5f52\u6cd5\u6765\u907f\u514d\u6027\u80fd\u95ee\u9898\u3002<\/strong><\/p>\n<\/p>\n
\u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n
 \u5982\u4f55\u5728Python\u4e2d\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u7684\u548c\uff1f<\/strong>
\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u6216\u9012\u5f52\u7684\u65b9\u5f0f\u6765\u8ba1\u7b97\u5947\u6570\u9636\u4e58\u7684\u548c\u3002\u9996\u5148\uff0c\u5b9a\u4e49\u4e00\u4e2a\u51fd\u6570\u6765\u8ba1\u7b97\u9636\u4e58\uff0c\u7136\u540e\u5728\u4e3b\u7a0b\u5e8f\u4e2d\u904d\u5386\u6240\u6709\u5947\u6570\u5e76\u7d2f\u52a0\u5b83\u4eec\u7684\u9636\u4e58\u503c\u3002\u4f8b\u5982\uff0c\u53ef\u4ee5\u4f7f\u7528for<\/code>\u5faa\u73af\u904d\u5386\u8303\u56f4\u5185\u7684\u5947\u6570\u5e76\u8c03\u7528\u9636\u4e58\u51fd\u6570\u6765\u5b8c\u6210\u6b64\u4efb\u52a1\u3002<\/p>\n
\u6709\u4ec0\u4e48\u6709\u6548\u7684\u65b9\u6cd5\u6765\u4f18\u5316\u5947\u6570\u9636\u4e58\u7684\u8ba1\u7b97\uff1f<\/strong>
\u4e3a\u4e86\u63d0\u9ad8\u8ba1\u7b97\u6548\u7387\uff0c\u53ef\u4ee5\u4f7f\u7528\u7f13\u5b58\u6280\u672f\u6765\u5b58\u50a8\u5df2\u7ecf\u8ba1\u7b97\u8fc7\u7684\u9636\u4e58\u503c\uff0c\u907f\u514d\u91cd\u590d\u8ba1\u7b97\u3002\u53ef\u4ee5\u5229\u7528Python\u7684\u5185\u7f6e\u5b57\u5178\u6216functools.lru_cache<\/code>\u88c5\u9970\u5668\u6765\u5b9e\u73b0\u8fd9\u4e00\u70b9\u3002\u6b64\u5916\uff0c\u8003\u8651\u4f7f\u7528\u751f\u6210\u5668\u6765\u9010\u6b65\u8ba1\u7b97\u9636\u4e58\uff0c\u51cf\u5c11\u5185\u5b58\u6d88\u8017\u3002<\/p>\n
\u5728\u5904\u7406\u5927\u578b\u6570\u5b57\u65f6\uff0cPython\u5982\u4f55\u5904\u7406\u9636\u4e58\u7684\u8ba1\u7b97\uff1f<\/strong>
Python\u7684\u6574\u6570\u7c7b\u578b\u652f\u6301\u4efb\u610f\u7cbe\u5ea6\uff0c\u56e0\u6b64\u5728\u8ba1\u7b97\u8f83\u5927\u7684\u5947\u6570\u9636\u4e58\u65f6\uff0c\u4e0d\u4f1a\u50cf\u67d0\u4e9b\u7f16\u7a0b\u8bed\u8a00\u90a3\u6837\u53d7\u5230\u6ea2\u51fa\u7684\u9650\u5236\u3002\u4e0d\u8fc7\uff0c\u8ba1\u7b97\u5927\u6570\u7684\u9636\u4e58\u53ef\u80fd\u4f1a\u5bfc\u81f4\u6027\u80fd\u95ee\u9898\uff0c\u56e0\u6b64\u5728\u5904\u7406\u6781\u5927\u7684\u6570\u5b57\u65f6\uff0c\u53ef\u4ee5\u8003\u8651\u4f7f\u7528\u6570\u5b66\u5e93\u6216\u4f18\u5316\u7b97\u6cd5\u6765\u63d0\u9ad8\u6548\u7387\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"\u5728Python\u4e2d\uff0c\u6c42\u5947\u6570\u9636\u4e58\u4e4b\u548c\u7684\u65b9\u6cd5\u6709\u591a\u79cd\uff0c\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u3001\u9012\u5f52\u7b49\u65b9\u5f0f\u3002 \u4e00\u79cd\u5e38\u89c1\u7684\u65b9\u5f0f\u662f\u4f7f\u7528\u5faa\u73af\u904d\u5386\u6240\u6709\u5947\u6570 […]","protected":false},"author":3,"featured_media":1167284,"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\/1167275"}],"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=1167275"}],"version-history":[{"count":"1","href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1167275\/revisions"}],"predecessor-version":[{"id":1167287,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1167275\/revisions\/1167287"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/1167284"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=1167275"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=1167275"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=1167275"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}