I have met a problem about LCS so hard for me.↵
There are two strings **S1,S2**. **|S1|,|S2**|<=5000.↵
Let **n** is the max length of two strings.↵
Is there a **O(n^2)**solution which can find S2's all subtrings's longest common sequence with S1 ?↵
Most thanks!
There are two strings **S1,S2**. **|S1|,|S2**|<=5000.↵
Let **n** is the max length of two strings.↵
Is there a **O(n^2)**solution which can find S2's all subtrings's longest common sequence with S1 ?↵
Most thanks!
