19 lines
375 B
Go
19 lines
375 B
Go
// Package q1653 implements a solution for https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/
|
|
package q1653
|
|
|
|
func minimumDeletions(s string) int {
|
|
bestA, bestB := 0, 0
|
|
|
|
for i := range len(s) {
|
|
switch s[i] {
|
|
case 'a':
|
|
bestB++
|
|
case 'b':
|
|
bestA, bestB = bestA+1, min(bestA, bestB)
|
|
}
|
|
}
|
|
|
|
return min(bestA, bestB)
|
|
}
|
|
|
|
var _ = minimumDeletions
|