What is the best way to get cyclic substrings
1 answer
For example,
package main
import (
"fmt"
"unicode/utf8"
)
func cyclicSubstrings(str string) []string {
n := utf8.RuneCountInString(str)
substrs := make([]string, 0, n*n)
cycles := str + str
for i := range str {
cycle := cycles[i : i+len(str)]
for j, r := range cycle {
substrs = append(substrs, cycle[:j+utf8.RuneLen(r)])
}
}
return substrs
}
func main() {
peptide := "LENQ"
fmt.Println(cyclicSubstrings(peptide))
}
Output:
[L LE LEN LENQ E EN ENQ ENQL N NQ NQL NQLE Q QL QLE QLEN]
+4
source to share