题解 | DNA序列

package main

import (
	"fmt"
	"strings"
)

func main() {
    var s string
    var k int
    fmt.Scan(&s, &k)
    max := 0
    idx := 0
    for i:=0; i<=len(s)-k; i++ {
        if strings.Contains(s[i:i+k], "C") || strings.Contains(s[i:i+k], "G") {
            c := strings.Count(s[i:i+k], "C")
            g := strings.Count(s[i:i+k], "G")
            if max < c + g {
                max = c + g
                idx =i
            }
        } 
    }
    if max > 0 {
        fmt.Println(s[idx:idx+k])
    }
}