如何找到按字典顺序排列的最小字符串旋转次数?
例如:
S = abab, N = 2 S = abca, N = 1 S = aaaa, N = 4
我试过Duval的算法,它的工作时间很长.字符串长度为100000000个字符.
string algorithm circular-buffer
algorithm ×1
circular-buffer ×1
string ×1