string_match
Given 2 strings, a and b, return the number of the positions where they contain the same length 2 substring. So "xxcaazz" and "xxbaaz" yields 3, since the "xx", "aa", and "az" substrings appear in the same place in both strings.
string_match('xxcaazz', 'xxbaaz') → 3 string_match('abc', 'abc') → 2 string_match('abc', 'axc') → 0
|
def string_match(a, b):
if len(a) <2 or len(b)<2:
return 0
count = 0
for i in range((min(len(a), len(b)))-1):
if a[i:i+2] == b[i:i+2]:
count += 1
return count
#本来L5写的是 for i in range(len(a)) and range(len(b)),出错了,看了solution学到了min()函数