Advertisement
Guest User

Untitled

a guest
Jun 15th, 2019
82
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. #PF-Prac-45
  2.  
  3. def longest_common_substring(string1, string2):
  4. #start writing your code here
  5. maxs=""
  6. final=[]
  7. for i in range(len(string1)):
  8. if string1[i] in string2:
  9. maxs=string1[i]
  10. for j in range(i+1,len(string1)):
  11. if maxs+string1[j] in string2:
  12. temp=maxs+string1[j]
  13. if len(maxs)>len(temp):
  14. continue
  15. else:
  16. maxs=temp
  17. if j==len(string1)-1:
  18. return maxs
  19. else:
  20. break
  21. return maxs
  22.  
  23. return string1[x_longest - longest: x_longest]
  24.  
  25. output=longest_common_substring("discatenation","concatenation")
  26. print("The longest overlap of characters between string1 and string2:",output)
  27. output1=longest_common_substring("assured","measured")
  28. print("The longest overlap of characters between string1 and string2:",output1)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement