{"id":207161,"date":"2025-07-08T08:02:35","date_gmt":"2025-07-08T00:02:35","guid":{"rendered":"https:\/\/server.hk\/cnblog\/207161\/"},"modified":"2025-07-08T08:02:35","modified_gmt":"2025-07-08T00:02:35","slug":"%e5%9c%a8-go-%e4%b8%ad%e6%8c%89%e5%ad%97%e6%af%8d%e9%a1%ba%e5%ba%8f%e6%9f%a5%e6%89%be%e7%9b%b8%e7%ad%89%e5%88%86%e9%9a%94%e7%9a%84%e5%ad%97%e7%ac%a6%e4%b8%b2-%e5%8d%95%e8%af%8d","status":"publish","type":"post","link":"https:\/\/server.hk\/cnblog\/207161\/","title":{"rendered":"\u5728 Go \u4e2d\u6309\u5b57\u6bcd\u987a\u5e8f\u67e5\u627e\u76f8\u7b49\u5206\u9694\u7684\u5b57\u7b26\u4e32\/\u5355\u8bcd"},"content":{"rendered":"<p><b><\/b> <\/p>\n<p>\u5f53\u524d\u4f4d\u7f6e\uff1a <span>&gt;<\/span> <span>&gt;<\/span> <span>&gt;<\/span> <span>&gt;<\/span> <span>\u5728 Go \u4e2d\u6309\u5b57\u6bcd\u987a\u5e8f\u67e5\u627e\u76f8\u7b49\u5206\u9694\u7684\u5b57\u7b26\u4e32\/\u5355\u8bcd<\/span><\/p>\n<p><span>\u6765\u6e90\uff1astackoverflow<\/span><br \/>\n<span>2024-04-20 14:48:37<\/span><br \/>\n<span><i><\/i>0\u6d4f\u89c8<\/span><br \/>\n<span style=\"cursor: pointer\"><i><\/i>\u6536\u85cf<\/span> <\/p>\n<p>\u79ef\u7d2f\u77e5\u8bc6\uff0c\u80dc\u8fc7\u79ef\u84c4\u91d1\u94f6\uff01\u6bd5\u7adf\u5728Golang\u5f00\u53d1\u7684\u8fc7\u7a0b\u4e2d\uff0c\u4f1a\u9047\u5230\u5404\u79cd\u5404\u6837\u7684\u95ee\u9898\uff0c\u5f80\u5f80\u90fd\u662f\u4e00\u4e9b\u7ec6\u8282\u77e5\u8bc6\u70b9\u8fd8\u6ca1\u6709\u638c\u63e1\u597d\u800c\u5bfc\u81f4\u7684\uff0c\u56e0\u6b64\u57fa\u7840\u77e5\u8bc6\u70b9\u7684\u79ef\u7d2f\u662f\u5f88\u91cd\u8981\u7684\u3002\u4e0b\u9762\u672c\u6587\u300a\u5728 Go \u4e2d\u6309\u5b57\u6bcd\u987a\u5e8f\u67e5\u627e\u76f8\u7b49\u5206\u9694\u7684\u5b57\u7b26\u4e32\/\u5355\u8bcd\u300b\uff0c\u5c31\u5e26\u5927\u5bb6\u8bb2\u89e3\u4e00\u4e0b\u77e5\u8bc6\u70b9\uff0c\u82e5\u662f\u4f60\u5bf9\u672c\u6587\u611f\u5174\u8da3\uff0c\u6216\u8005\u662f\u60f3\u641e\u61c2\u5176\u4e2d\u67d0\u4e2a\u77e5\u8bc6\u70b9\uff0c\u5c31\u8bf7\u4f60\u7ee7\u7eed\u5f80\u4e0b\u770b\u5427~<\/p>\n<p> \u95ee\u9898\u5185\u5bb9<br \/>\n <\/p>\n<p>\u6211\u8bd5\u56fe\u627e\u5230\u5728\u5b57\u6bcd\u8868\u7684\u5706\u5f62\u6392\u5217\u4e2d\u7b49\u8ddd\u5206\u9694\u7684\u5355\u8bcd\/\u5b57\u7b26\u4e32\u3002\u4f8b\u5982\uff1a<\/p>\n<ul>\n<li>\u201czzzzyyyybbbzzzaaaaaxxx\u201d\u662f\u7531\u201cxyzab\u201d\u7ec4\u6210\u7684\u5217\u8868\uff0c\u5206\u9694\u7b26\u4e3a 0 {xy, yz, za, ab}<\/li>\n<li>\u201caco\u201d\u662f\u4e00\u4e2a\u5206\u9694\u7b26\u4e3a 11 {co, oa} \u7684\u5217\u8868<\/li>\n<\/ul>\n<p>\u56e0\u6b64\uff0c\u6211\u60f3\u7f16\u5199\u51fd\u6570 isseparated(b) \u5e76\u5728 b \u4e3a\u201cisseparated\u201d\u65f6\u8fd4\u56de true<\/p>\n<p>\u4ee5\u4e0b\u662f\u6211\u7684\u4ee3\u7801\/\u89e3\u51b3\u65b9\u6848\uff1a<\/p>\n<ul>\n<li>\u9996\u5148\uff0c\u6211\u5c1d\u8bd5\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u91cd\u590d\u9879\uff0c\u4ee5\u4fbf\u66f4\u5bb9\u6613\u8ba1\u7b97\u95f4\u9694<\/li>\n<li>\u7b2c\u4e8c\uff0c\u6211\u6309\u5b57\u6bcd\u987a\u5e8f\u5bf9\u5b57\u7b26\u4e32\u8fdb\u884c\u6392\u5e8f<\/li>\n<li>\u7b2c\u4e09\uff0c\u6392\u5e8f\u540e\uff0c\u6211\u8ba1\u7b97\u6bcf\u4e2a\u5b57\u6bcd\u7684\u95f4\u9694<\/li>\n<li>\u5728\u201cisseparated\u201d\u65b9\u6cd5\u4e2d\uff0c\u6211\u5c1d\u8bd5\u4f7f\u7528 <code>maxpair -1 == count<\/code> \u4f7f\u5176\u4ee5\u5faa\u73af\u6392\u5217\u65b9\u5f0f\u8ba1\u6570\uff0c\u56e0\u4e3a\u603b\u4f1a\u6709 1 \u4e2a\u5b57\u6bcd\u6ca1\u6709\u914d\u5bf9<\/li>\n<li><code>[{ab} {bx} {xy} {yz} {za}] - [{0} {21} {0} {0} {0}]]\/\/\u67095\u4e2a \u5bf9 = maxpair -1({-xy}<\/code><\/li>\n<\/ul>\n<p>\u56e0\u6b64\uff0c\u7531\u4e8e\u5b83\u662f\u5706\u5f62\u6392\u5217\u7684\uff0c\u6240\u4ee5\u4e2d\u95f4\u7684\u603b\u662f\u5947\u6570\uff0c\u5373 21\uff0c\u4e0e\u5176\u4f59\u5bf9\u7684\u95f4\u9694\u4e0d\u76f8\u7b49<\/p>\n<p>\u8fd9\u662f\u53d8\u5f97\u68d8\u624b\u7684\u90e8\u5206\uff0c\u6211\u4f3c\u4e4e\u65e0\u6cd5\u83b7\u5f97\u6240\u9700\u7684\u8f93\u51fa\u3002\u6309\u5b57\u6bcd\u987a\u5e8f\u67e5\u627e\u6bcf\u4e2a\u5b57\u6bcd\u7684\u957f\u5ea6\/\u5206\u9694\u5e76\u68c0\u67e5\u5b83\u4eec\u662f\u5426\u5747\u5300\u5206\u9694\u7684\u6b63\u786e\u65b9\u6cd5\u53ef\u80fd\u662f\u4ec0\u4e48\u3002<\/p>\n<pre>package main\n\nimport (\n    \"fmt\"\n    \"strings\"\n)\n\n\/\/Q3\nfunc separationCount(x, y string) int {\n    alphabets := [26]string{\"a\",\"b\",\"c\",\"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\",\"v\", \"w\", \"x\", \"y\", \"z\"}\n    separation := 0\n\n    for i:=0; i &lt; len(alphabets); i++{\n        if x == alphabets[i]{\n\n            for j:= i+1; j &lt;len(alphabets); j++{\n            if y == alphabets[i+1]{\n            fmt.Println(separation)\n            return separation\n            }else{\n                i++\n                separation++\n            } \n            }\n                }else{\n            \/\/do nothing\n        }\n    }\n    \/\/fmt.Println(separation)\n    return 0\n}\n\nfunc isSeparated(B [] string) bool {\n    var N int = len(B) - 1\n    var maxPair int\n    var item1 string\n    var item2 string\n    var separation int = 0 \n    count := 0\n    var intialSeparation int\n\n    \/\/calling the methods\n    fmt.Println(\"Original array:\",B)\n    B = removeDuplicates(B)\n    B = sortedList(B)\n\n    item1 = B[0]\n    item2 = B[1]\n    intialSeparation = separationCount(item1,item2)\n\n    for i := 0; i&lt; N; i++{\n        item1 = B[i]\n        item2 = B[i + 1]\n\n        separation = separationCount(item1,item2)\n        maxPair++\n        if intialSeparation == separation{\n            count++\n        }\n\n        if maxPair == count{\n            return true\n        }else{\n            return false\n        }\n\n    }\n    return false\n}\n\n\/\/to sort the alphabets \nfunc sortedList(B []string) [] string {\n    N  := len(B)\n    \/\/max := 0\n    element1 := 0 \n    element2 := 1\n\n    for element2 &lt; N {\n        var item1 string = B[element1]\n        var item2 string = B[element2]\n\n        \/\/using function call\n        if greater(item1, item2){\n            B[element1] = item2\n            B[element2] = item1\n        }\n        element1++\n        element2++\n    } \n    fmt.Println(\"Alphabetically sorted:\", B )\n    return B\n}\n\n\/\/for sorting\nfunc greater(a, b string) bool {\n    if strings.ToLower(a) &gt; strings.ToLower(b) {\n      return true\n    } else {\n      return false\n    }\n  }\n\n  \/\/removing duplicates\nfunc removeDuplicates(B []string) []string {\n    encountered := map[string]bool{}\n\n    \/\/ Create a map of all unique elements.\n    for v:= range B {\n        encountered[B[v]] = true\n    }\n\n    \/\/ Place all keys from the map into a slice.\n    result := []string{}\n    for key, _ := range encountered {\n        result = append(result, key)\n    }\n    fmt.Println(\"Duplicates removed:\", result )\n    return result\n}\n\nfunc main(){\n    \/\/q3\n    B := []string{\"y\", \"a\", \"a\", \"a\", \"c\", \"e\", \"g\", \"w\", \"w\", \"w\"}\n    fmt.Println(isSeparated(B))\n}<\/pre>\n<p> <\/p>\n<h2>\u89e3\u51b3\u65b9\u6848<\/h2>\n<p> <\/p>\n<p>\u6211\u4e0d\u592a\u660e\u767d\u4f60\u8bd5\u56fe\u786e\u5b9a\u5206\u79bb\u7684\u90e8\u5206\u3002\u5728 go \u4e2d\uff0c\u5c31\u50cf\u5728 c \u4e2d\u4e00\u6837\uff0c\u60a8\u53ef\u4ee5\u5bf9\u5b57\u7b26\u8fdb\u884c\u7b97\u672f\u8fd0\u7b97\u3002\u4f8b\u5982\uff0c\u60a8\u5c06\u83b7\u5f97\u6bcf\u4e2a\u5c0f\u5199\u5b57\u6bcd\u7684\u4ece 0 \u5f00\u59cb\u7684\u7d22\u5f15\uff1a<\/p>\n<pre>pos := char - 'a';<\/pre>\n<p>\u60a8\u53ef\u4ee5\u5c06 <code>\"abxyz\"<\/code> \u8f6c\u4e3a<\/p>\n<pre>{0, 1, 23, 24, 25}.<\/pre>\n<p>\u5982\u679c\u4f60\u8ba1\u7b97\u76f8\u90bb\u5b57\u6bcd\u4e4b\u95f4\u7684\u5dee\u5f02\uff0c\u4f60\u4f1a\u5f97\u5230<\/p>\n<pre>{-25, 1, 22, 1, 1}<\/pre>\n<p>\uff08-25 \u662f\u6700\u540e\u4e00\u4e2a\u503c\u548c\u7b2c\u4e00\u4e2a\u503c\u4e4b\u95f4\u7684\u5dee\u503c\u3002\uff09\u6709\u4e24\u4e2a\u95f4\u9699\uff1a\u4e00\u4e2a\u662f\u5faa\u73af\u5728 b \u548c w \u4e4b\u95f4\u5f00\u59cb\uff0c\u53e6\u4e00\u4e2a\u662f\u5b57\u6bcd\u6362\u884c\u3002\u7b2c\u4e8c\u4e2a\u95f4\u9699\u662f\u5dee\u503c\u4e3a\u8d1f\u7684\u5730\u65b9\uff0c\u603b\u662f\u5728\u6700\u540e\u4e00\u9879\u548c\u7b2c\u4e00\u9879\u4e4b\u95f4\u3002\u60a8\u53ef\u4ee5\u5728\u5dee\u503c\u4e0a\u52a0\u4e0a 26 \u6765\u8c03\u6574\u5b83\uff0c\u4e5f\u53ef\u4ee5\u4f7f\u7528\u6a21\u7b97\u672f\uff0c\u5176\u4e2d\u4f7f\u7528\u4f59\u6570 <code>%<\/code> \u6765\u8ba1\u7b97\u73af\u7ed5\uff1a<\/p>\n<pre>diff := ((p - q + 26) % 26;<\/pre>\n<p>\u5982\u679c\u7b2c\u4e00\u4e2a\u64cd\u4f5c\u6570\u4e3a\u6b63\uff0c\u5219 <code>%<\/code> \u4f1a\u5f3a\u5236\u7ed3\u679c\u8303\u56f4\u4e3a 0 \u5230 25\u3002 + 26 \u5f3a\u5236\u5176\u4e3a\u6b63\u6570\u3002 \uff08\u4e0b\u9762\u7684\u7a0b\u5e8f\u4f7f\u7528 25\uff0c\u56e0\u4e3a\u60a8\u5bf9\u5206\u9694\u7684\u5b9a\u4e49\u4e0d\u662f\u4f4d\u7f6e\u7684\u5dee\u5f02\uff0c\u800c\u662f\u4e4b\u95f4\u7684\u8fc7\u6ee4\u5668\u6570\u91cf\u3002\uff09<\/p>\n<p>\u73b0\u5728\u4f60\u6709\u4e86\u5dee\u5f02<\/p>\n<pre>{1, 1, 22, 1, 1}<\/pre>\n<p>\u5f53\u60a8\u6700\u591a\u53ea\u6709\u4e24\u4e2a\u4e0d\u540c\u7684\u503c\u5e76\u4e14\u5176\u4e2d\u4e00\u4e2a\u6700\u591a\u51fa\u73b0\u4e00\u6b21\u65f6\uff0c\u60a8\u7684\u6761\u4ef6\u5c31\u5f97\u5230\u6ee1\u8db3\u3002 \uff08\u6211\u53d1\u73b0\u8fd9\u4e2a\u6761\u4ef6\u6d4b\u8bd5\u8d77\u6765\u975e\u5e38\u590d\u6742\uff0c\u89c1\u4e0b\u6587\uff0c\u4f46\u90e8\u5206\u539f\u56e0\u662f go \u7684\u6620\u5c04\u6709\u70b9\u9ebb\u70e6\u3002\uff09<\/p>\n<p>\u65e0\u8bba\u5982\u4f55\uff0c\u8fd9\u662f\u4ee3\u7801\uff1a<\/p>\n<pre>package main\n\nimport \"fmt\"\n\nfunc list(str string) int {\n    present := [26]bool{}\n    pos := []int{}\n\n    count := map[int]int{}\n\n    \/\/ determine which letters exist\n    for _, c := range str {\n        if 'a' &lt;= c &amp;&amp; c &lt;= 'z' {\n            present[c-'a'] = true\n        }\n    }\n\n    \/\/ concatenate all used letters (count sort, kinda)\n    for i := 0; i &lt; 26; i++ {\n        if present[i] {\n            pos = append(pos, i)\n        }\n    }\n\n    \/\/ find differences\n    q := pos[len(pos)-1]\n    for _, p := range pos {\n        diff := (p - q + 25) % 26\n\n        count[diff]++\n        q = p\n    }\n\n    \/\/ check whether input is a \"rambai\"\n    if len(count) &gt; 2 {\n        return -1\n    }\n\n    which := []int{}\n    occur := []int{}\n    for k, v := range count {\n        which = append(which, k)\n        occur = append(occur, v)\n    }\n\n    if len(which) &lt; 2 {\n        return which[0]\n    }\n\n    if occur[0] != 1 &amp;&amp; occur[1] != 1 {\n        return -1\n    }\n\n    if occur[0] == 1 {\n        return which[1]\n    }\n\n    return which[0]\n}\n\nfunc testme(str string) {\n    fmt.Printf(\"\\\"%s\\\": %d\\n\", str, list(str))\n}\n\nfunc main() {\n    testme(\"zzzzyyyybbbzzzaaaaaxxx\")\n    testme(\"yacegw\")\n    testme(\"keebeebheeh\")\n    testme(\"aco\")\n    testme(\"naan\")\n    testme(\"mississippi\")\n    testme(\"rosemary\")\n}<\/pre>\n<\/p>\n<p>\u4eca\u5929\u5173\u4e8e\u300a\u5728 Go \u4e2d\u6309\u5b57\u6bcd\u987a\u5e8f\u67e5\u627e\u76f8\u7b49\u5206\u9694\u7684\u5b57\u7b26\u4e32\/\u5355\u8bcd\u300b\u7684\u5185\u5bb9\u5c31\u4ecb\u7ecd\u5230\u8fd9\u91cc\u4e86\uff0c\u662f\u4e0d\u662f\u5b66\u8d77\u6765\u4e00\u76ee\u4e86\u7136\uff01\u60f3\u8981\u4e86\u89e3\u66f4\u591a\u5173\u4e8e\u7684\u5185\u5bb9\u8bf7\u5173\u6ce8\u516c\u4f17\u53f7\uff01<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u5f53\u524d\u4f4d\u7f6e\uff1a &gt; &gt; &#46;&#46;&#46;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4925],"tags":[],"class_list":["post-207161","post","type-post","status-publish","format-standard","hentry","category-4925"],"_links":{"self":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/207161","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/comments?post=207161"}],"version-history":[{"count":0,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/207161\/revisions"}],"wp:attachment":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/media?parent=207161"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/categories?post=207161"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/tags?post=207161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}