Find whether string s is divisible by string t. A string s divisible by string t if string t can be concatenated some number of times to obtain the string s.
If s is divisible, find the smallest string u such that it can be concatenated some number of times to obtain both s and t.
If it is not divisible, set the return value to -1.
Final
le by string t, or return -1 if not.
findSmallestDivisor has the following parameter(s):
s : string s
t : string t
Constraints
1 ≤ size of s ≤ 2 x 105
1 ≤ size of t ≤ 2 x105
size of t ≤ size of s
狗仔卡
收藏
淘帖
好苗
杂草
匿名用户-UUNSV
提升卡
置顶卡
关贴卡
开贴卡
变色卡
千斤顶
