题解 | 小红的双生串

package main

import (
    "fmt"
)

func main() {
    var s string
    fmt.Scan(&s)
    n := len(s)
    s1 := s[:n/2]
    s2 := s[n/2:]
    set1 := make(map[rune]int)
    set2 := make(map[rune]int)
    for _, c := range s1 {
        set1[c]++
    }
    for _, c := range s2 {
        set2[c]++
    }
    max1 := maxValueInMap(set1)
    max2 := maxValueInMap(set2)
    fmt.Println(n-max1-max2)
}

func maxValueInMap(m map[rune]int) int {
    max := 0
    for _, v := range m {
        if v > max {
            max = v
        }
    }
    return max
}