{"id":195,"date":"2013-06-09T20:50:01","date_gmt":"2013-06-09T12:50:01","guid":{"rendered":"http:\/\/coderbee.net\/?p=195"},"modified":"2014-11-28T20:32:39","modified_gmt":"2014-11-28T12:32:39","slug":"%e6%b1%82%e5%85%83%e7%b4%a0%e7%b4%af%e5%8a%a0%e5%92%8c%e6%9c%80%e5%a4%a7%e7%9a%84%e5%ad%90%e6%95%b0%e7%bb%84","status":"publish","type":"post","link":"https:\/\/coderbee.net\/index.php\/algorithm\/20130609\/195","title":{"rendered":"\u6c42\u5143\u7d20\u7d2f\u52a0\u548c\u6700\u5927\u7684\u5b50\u6570\u7ec4"},"content":{"rendered":"<h2>\u95ee\u9898\u63cf\u8ff0<\/h2>\n<p>\u5bf9\u4e8e\u4e00\u4e2a\u7ed9\u5b9a\u7684\u6574\u6570\u6570\u7ec4<code>arr[0...n)<\/code>\uff0c\u6c42\u8fd9\u6837\u4e00\u4e2a\u5b50\u6570\u7ec4\uff0c\u5b83\u7684\u5143\u7d20\u7684\u7d2f\u52a0\u548c\u5728\u6240\u6709\u5b50\u6570\u7ec4\u4e2d\u662f\u6700\u5927\u7684\u3002<\/p>\n<p>\u8fd9\u4e2a\u9898\u5728\u300a\u7f16\u7a0b\u73e0\u7391\u300b\u4e00\u4e66\u4e2d\u6709\u4ecb\u7ecd\uff0c\u4ee5\u524d\u4e5f\u662f\u5728\u8fd9\u672c\u4e66\u4e0a\u770b\u5230\u89e3\u51b3\u65b9\u6cd5\u540e\u5c31\u518d\u4e5f\u6ca1\u6709\u5fd8\u8bb0\u4e86\u3002\u73b0\u5728\u91cd\u65b0\u5b9e\u73b0\u5e76\u8bb0\u5f55\u4e00\u4e0b\uff0c\u8bb0\u5f55\u4e86\u4ece\u6700\u4f4e\u6548\u76843\u91cd\u5faa\u73af\u89e3\u51b3\u65b9\u6cd5\u5230\u6700\u9ad8\u6548\u7684\u7ebf\u6027\u65f6\u95f4\u89e3\u51b3\u65b9\u6cd5\u53ca\u5176\u4e2d\u7684\u4f18\u5316\u8003\u91cf\u3002<br \/>\n<!--more--><\/p>\n<h2>3\u91cd\u5faa\u73af<\/h2>\n<p>\u6700\u76f4\u63a5\u7684\u60f3\u6cd5\u662f\u75283\u91cd\u5faa\u73af\uff0c\u8ba1\u7b97\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u548c\uff0c\u8fd9\u6837\u7684\u6548\u7387\u592a\u4f4e\u4e86\u3002<\/p>\n<h3>\u5b9e\u73b0<\/h3>\n<pre><code language=\"go\">\nfunc SubSeqHasMaxSum3Loop(arr []int) []int {\n    mSum, mL, mR := arr[0], 0, 0\n    for i, limit := 0, len(arr); i < limit; i++ {\n        for j := i; j < limit; j++ {\n            sum := 0\n            for k := i; k <= j; k++ {\n                sum += arr[k]\n            }\n            if sum > mSum {\n                mSum = sum\n                mL = i\n                mR = j\n            }\n        }\n    }\n    return arr[mL : mR+1]\n}\n<\/code><\/pre>\n<h2>2\u91cd\u5faa\u73af<\/h2>\n<p>\u4e00\u4e2a\u4f18\u5316\u70b9\u662f\uff1a\u5047\u5982\u5f53\u524d\u4e00\u4e2a\u5b50\u6570\u7ec4\u4e3a<code>arr[l...r]<\/code>\uff0c\u5176\u7d2f\u52a0\u548c\u4e3a<code>sum<\/code>\uff0c\u90a3\u4e48\u5b50\u6570\u7ec4<code>arr[l...r+1]<\/code>\u7684\u7d2f\u52a0\u548c\u53ef\u4ee5\u901a\u8fc7<code>sum+arr[r+1]<\/code>\u5f97\u5230\u3002<\/p>\n<p>\u8fd9\u6837\u53ef\u4ee5\u628a3\u91cd\u5faa\u73af\u4f18\u5316\u4e3a2\u91cd\u5faa\u73af\u3002<\/p>\n<h3>\u5b9e\u73b0<\/h3>\n<pre><code language=\"go\">\nfunc SubSeqHasMaxSum2Loop(arr []int) []int {\n    mSum, mL, mR := arr[0], 0, 0\n    for i, limit := 0, len(arr); i < limit; i++ {\n        sum := 0\n        for j := i; j < limit; j++ {\n            sum += arr[j]\n            if sum > mSum {\n                mSum = sum\n                mL = i\n                mR = j\n            }\n        }\n    }\n    return arr[mL : mR+1]\n<\/code><\/pre>\n<h2>\u7ebf\u6027\u65f6\u95f4\u89e3\u51b3<\/h2>\n<p>\u4e0a\u9762\u76842\u91cd\u5faa\u73af\u5e76\u4e0d\u662f\u6700\u4f18\u7684\uff0c\u8fd9\u4e2a\u7ebf\u6027\u65f6\u95f4\u89e3\u51b3\u65b9\u6cd5\u4ecd\u7136\u4e0e\u524d\u9762\u7684\u4f18\u5316\u65b9\u6848\u6709\u5173\u3002<\/p>\n<p>\u5148\u6765\u770b\u4e0b\u6574\u6570\u5bf9\u4e8e\u52a0\u6cd5\u7684\u4f5c\u7528\uff1a\u5bf9\u4e8e\u4e00\u4e2a\u6574\u6570<code>i<\/code>\uff0c\u5982\u679c <code>i &gt; 0<\/code>\uff0c\u90a3\u4e48\u5b83\u4f1a\u8ba9\u7d2f\u52a0\u548c\u589e\u52a0\uff1b\u5982\u679c <code>i &lt; 0<\/code>\uff0c\u5b83\u4f1a\u8ba9\u7d2f\u52a0\u548c\u51cf\u5c11\uff1b<code>i==0<\/code>\u5bf9\u7d2f\u52a0\u548c\u6ca1\u6709\u5f71\u54cd\u3002<\/p>\n<ul>\n<li>\n<p>\u5982\u679c\u5f53\u524d\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\u7684\u7d2f\u52a0\u548c<code>sum &lt;= 0<\/code>\uff0c\u90a3\u4e48\u4e0d\u7ba1\u63a5\u4e0b\u6765\u7684\u5143\u7d20<code>v<\/code>\u7684\u503c\u5982\u4f55\uff0c\u5b83\u5bf9\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\u7684\u7d2f\u52a0\u548c\u90fd\u662f\u8d1f\u4f5c\u7528\u6216\u65e0\u4f5c\u7528\u7684\uff0c\u53ef\u4ee5\u5b89\u5168\u5730\u6392\u9664\u5f53\u524d\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\uff0c\u800c\u628a\u4e0b\u4e00\u4e2a\u5143\u7d20\u4f5c\u4e3a\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\u3002<\/p>\n<\/li>\n<li>\n<p>\u5982\u679c\u5f53\u524d\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\u7684\u7d2f\u52a0\u548c<code>sum &gt; 0<\/code>\uff0c\u90a3\u4e48\u4e0d\u7ba1\u63a5\u4e0b\u6765\u7684\u5143\u7d20<code>v<\/code>\u7684\u503c\u5982\u4f55\uff0c\u53ef\u4ee5\u76f4\u63a5\u628a\u5b83\u7eb3\u5165\u5f53\u524d\u53ef\u80fd\u7684\u76ee\u6807\u5b50\u6570\u7ec4\uff0c\u56e0\u4e3a\u5373\u4f7f<code>v &lt; 0<\/code>\uff0c\u4e5f\u53ef\u80fd\u6709\u66f4\u540e\u9762\u7684\u5143\u7d20\u662f\u5927\u4e8e\u5143\u7d20<code>v<\/code>\u7684\u7edd\u5bf9\u503c\u7684\uff0c\u4ece\u800c\u62b5\u6d88\u4e86\u5143\u7d20<code>v<\/code>\u7684\u526f\u4f5c\u7528\u3002<\/p>\n<\/li>\n<\/ul>\n<h3>\u5b9e\u73b0<\/h3>\n<pre><code language=\"go\">\nfunc SubSeqHasMaxSum(arr []int) []int {\n    if arr == nil || len(arr) < 1 {\n        return []int{}\n    }\n\n    maxSum, mL, mR, sum, l, r := arr[0], 0, 0, arr[0], 0, 1\n\n    for limit := len(arr); r < limit; r++ {\n        if sum <= 0 {\n            sum = arr[r]\n            l = r\n        } else {\n            sum += arr[r]\n        }\n\n        if sum > maxSum {\n            maxSum = sum\n            mR = r\n            mL = l\n        }\n    }\n\n    return arr[mL : mR+1]\n}\n<\/code><\/pre>\n<hr\/>\n<p>\u6b22\u8fce\u5173\u6ce8\u6211\u7684\u5fae\u4fe1\u516c\u4f17\u53f7: <strong>coderbee\u7b14\u8bb0<\/strong>\uff0c\u53ef\u4ee5\u66f4\u53ca\u65f6\u56de\u590d\u4f60\u7684\u8ba8\u8bba\u3002<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" width=\"258\" height=\"258\" src=\"https:\/\/coderbee.net\/wp-content\/uploads\/2019\/01\/coderbee-note.jpg\" class=\"alignnone size-full wp-image-1707\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u95ee\u9898\u63cf\u8ff0 \u5bf9\u4e8e\u4e00\u4e2a\u7ed9\u5b9a\u7684\u6574\u6570\u6570\u7ec4arr[0&#8230;n)\uff0c\u6c42\u8fd9\u6837\u4e00\u4e2a\u5b50\u6570\u7ec4\uff0c\u5b83\u7684\u5143\u7d20 &hellip; <a href=\"https:\/\/coderbee.net\/index.php\/algorithm\/20130609\/195\">\u7ee7\u7eed\u9605\u8bfb <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[53],"tags":[55],"_links":{"self":[{"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/posts\/195"}],"collection":[{"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/comments?post=195"}],"version-history":[{"count":6,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/posts\/195\/revisions"}],"predecessor-version":[{"id":1112,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/posts\/195\/revisions\/1112"}],"wp:attachment":[{"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/media?parent=195"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/categories?post=195"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/coderbee.net\/index.php\/wp-json\/wp\/v2\/tags?post=195"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}