Amit Parikh amitparikh
amitparikh
/ string_search.py
Last active
December 21, 2015 03:38
Find ALL matches between two strings with a configurable minimum match-length.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import sys | |
| s1_map = {} | |
| def build_s1_map(s1, min_str_len): | |
| for i in xrange(len(s1) - min_str_len + 1): | |
| k = s1[i] | |
| if k in s1_map: | |
| s1_map[k].append((s1[i : i + min_str_len], i)) | |
| else: |