给定如下输入字符串:
AB[C[DA,BF,GAL],DB[NX,AQQ,AAN,B],F[H[GG,BAND]]]
个
返回字符串数组:
["ABCDA", "ABCBF", "ABCGAL", "ABDBNX", "ABDBAQQ", "ABDBAAN", "ABDBB", "ABFHGG"]
我能够合成一个部分解,但如果有多个[children]
,它就很难跟踪父 node .
另一个测试字符串:ZHLADAOR[R[G[45D[COI,EMA],Q5D[COI,EMA],U5D[COI,EMA],Y5D[COI,EMA]],HE5D[COI,EMA]],SG[A5D[COI,EMA],E5D[COI,EMA],I5D[COI,EMA]]]
func expandNestedString(str string) []string {
var parts []string
var currentPart []rune
var openBrackets int
var level int
var bitsBeforeComma int
var prevBitsBeforeComma int
for _, char := range str {
if char == '[' {
openBrackets++
level++
prevBitsBeforeComma = bitsBeforeComma
bitsBeforeComma = 0
} else if char == ']' {
openBrackets--
if openBrackets == 0 {
if level == 0 && len(currentPart) > 0 {
parts = append(parts, string(currentPart))
}
currentPart = []rune{}
level--
} else {
parts = append(parts, string(currentPart))
currentPart = currentPart[:len(currentPart)-(bitsBeforeComma+prevBitsBeforeComma)]
bitsBeforeComma = 0
}
} else if char == ',' {
parts = append(parts, string(currentPart))
currentPart = currentPart[:len(currentPart)-bitsBeforeComma]
bitsBeforeComma = 0
} else {
currentPart = append(currentPart, char)
bitsBeforeComma++
}
}
if len(currentPart) > 0 {
parts = append(parts, string(currentPart))
}
return parts
}