I have some problems with this question. I spend a whole day to solve still cant get it>.<
This question is about loop.
Question:
A string "s" is repeating if it can be written as s1s2...sn, where s1 = s2 =...=sn and n >= 2.
Write a program that takes a string and prints the longest substring (largest in length) that is repeating. If there is more than one such substring,
your program should print the one that is closest to the left.
On the other hand, if there is no repeating substring, your program should print "no repeating substring".
Here are some sample runs.
1) C:\MyProg> lrs
input : abcddddabc
output : dddd
2) C:\MyProg> lrs
abababcabcpqpqr
ababab
3) C:\MyProg>lrs
ababpqrpqrabcabc
pqrpqr
4) C:\MyProg>lrs
abcdabc
no repeating substring

I wrote a program some years ago.
I think this program is similar than your case.

http://stud.sju.edu.tw/~89104011/unit.cpp

------
隨筆網誌: http://reassert.blogspot.com