在链接的答案中使用相同概念的一种方法是通过将它们转换为新的字符串来创建特定于您的单词的排名，这些字符串将按照您想要的顺序进行比较。为了方便起见，我们将使用可打印的字符作为在字符串词法比较中使用的秩值。

// rank each letter of the alphabet, using ascii characters as the value

var alphabet = strings.NewReplacer(
    "a", "a",
    "i", "b",
    "u", "c",
    "e", "d",
    "o", "e",
    "p", "f",
    "t", "g",
    "k", "h",
    "m", "i",
    "ng", "j",
    "n", "k",
    "b", "l",
    "d", "m",
    "g", "n",
)

您可以按需翻译每个比较的单词

sort.Slice(words, func(i, j int) bool {
    return alphabet.Replace(words[i]) < alphabet.Replace(words[j])
})

或者，如果你想用内存来换取比较时间，你可以将所有的单词预翻译成一个新的字符串，并根据这些进行排序：

translated := make([]string, 0, len(words))
for _, word := range words {
    translated = append(translated, alphabet.Replace(word))
}
sort.Slice(translated, func(i, j int) bool {
    less := translated[i] < translated[j]
    // swap the actual words slice in conjunction with the translated slice
    if less {
        words[i], words[j] = words[j], words[i]
    }
    return less
})

https://go.dev/play/p/h2rBvsS_UI-