algorithm - Longest common substring with constant memory? -
Given two strings - How can you find the longest normal object using only continuous memory?
Update: The constraints of time are solved in O (len1 * len2) like standard dynamic-programming solution.
constant memory and no time constraint ?
Just a cruel power method: Compare all the possibilities, keep only 6 integer indexed in memory: start
and expiration
for both strings, Plus 2 found so far for the longest string ...
Comments
Post a Comment