Sobes.tech
Principal

/** * Takrorlanadigan belgilar * * Kirish sifatida satr oladigan va har bir noyob belgi uchun maksimal ketma-ket takrorlanish sonini qaytaradigan funktsiya yozish kerak. * * Kirish: qqffbbaaaffc * Natija: a:4 b:1 f:2 c:1 * * Kirish: bbbbbb * Natija: b:6 * * Kirish: abc * Natija: a:1 b:1 c:1 * * Kirish: aabbcc * Natija: a:2 b:2 c:2 * * Kirish: aaabbbccc * Natija: a:3 b:3 c:3 * * Kirish: a * Natija: a:1 * * Kirish: "" * Natija: */

sobes.tech AI

AIdan javob

go package main

import ( "fmt" )

func maxRepeats(s string) map[rune]int { result := make(map[rune]int) if len(s) == 0 { return result }

var prev rune
count := 0

for i, ch := range s {
	if i == 0 {
		prev = ch
		count = 1
		continue
	}

	if ch == prev {
		count++
	} else {
		if count > result[prev] {
			result[prev] = count
		}
		prev = ch
		count = 1
	}
}

// Проверяем последний символ
if count > result[prev] {
	result[prev] = count
}

return result

}

func main() { tests := []string{ "qqffbbaaaffc", "bbbbbb", "abc", "aabbcc", "aaabbbccc", "a", "", }

for _, test := range tests {
	res := maxRepeats(test)
	fmt.Printf("Input: %s\nOutput: ", test)
	for ch, cnt := range res {
		fmt.Printf("%c:%d ", ch, cnt)
	}
	fmt.Println("\n")
}

}