最长重复子串问题



.问题描述：



在一个特定字符串str 中，多次出现的子串称为重复子串。如果字符串str 中有多个重复

子串，则其中长度最长的子串称为最长重复子串。例如，str=’abcdacdac’ ，则子串’cdac’ 是str

的最长重复子串。



.编程任务：



给定一个字符串str ，编程计算str 的最长重复子串。-longest repeated substrings problems. Problem descr iption : In a specific string str, repeated substrings called repeated substrings. If the string str There were several repeat substrings, which the length of the longest substrings called the longest repeat substrings. For instance, str = 'abcdacdac', substrings' cdac 'is the longest repeat str substrings. . Programming tasks : to set a string str, programmed to calculate the longest str repeat substrings.