19 lines
372 B
Go
19 lines
372 B
Go
// Package q2405 implements a solution for https://leetcode.com/problems/optimal-partition-of-string/
|
|
package q2405
|
|
|
|
func partitionString(s string) int {
|
|
var seen int32
|
|
|
|
partitions := 1
|
|
for i := range len(s) {
|
|
offset := s[i] - 'a'
|
|
if seen|1<<offset == seen {
|
|
partitions += 1
|
|
seen = 0
|
|
}
|
|
seen |= 1 << offset
|
|
}
|
|
return partitions
|
|
}
|
|
|
|
var _ = partitionString
|