[Swift-2019力扣杯春季决赛]3. 最长重复子串

 1 class Solution {
 2     var lcp:[[Int]] = [[Int]](repeating:[Int](repeating:0,count:1505),count:1505)
 3     func longestRepeatingSubstring(_ S: String) -> Int {
 4         var n:Int = S.count
 5         var ans:Int = 0
 6         var arrS:[Character] = Array(S)
 7         for i in stride(from:n - 1,through:0,by:-1)
 8         {
 9             for j in (i + 1)..<n
10             {
11                 if arrS[i] == arrS[j]
12                 {
13                     lcp[i][j] = lcp[i + 1][j + 1] + 1
14                 }
15                 else
16                 {
17                     lcp[i][j] = 0
18                 }
19                 ans=max(ans,lcp[i][j])
20             }        
21         }
22         return ans        
23     }
24 }