Any way to count overlapped strings within another string?

Question

What is the simple way to count the indexes(locations) of overlap characters identically between two string?

def overlap(string1, string2):

    count = 0

    for i in range(0,len(string1)-len(string2)+1):
        if string2 in string1[i:i+len(string2)]:
            count = count +1
    return count

I realize I have some issues with my function. Could someone please point out and explain? That would be so helpful!

sample:

overlap('abcb','dbeb') #output >>> 2, not 4
overlap('','winter')   #output >>> 0.

What is your current code's output, what would be the expected output? Are you looking for the same thing as question Overlapping count of substring in a string in Python, maybe? — das-g
– das-g, Commented Feb 28, 2016 at 17:00

Sci Prog · Accepted Answer · 2016-02-28 18:16:09Z

1

Since the strings can have different lengths, use the minimum length. Then compare them using array indexes, character by character. Conceptually:

def overlap(string1, string2):
  count=0
  for i in range(min(len(string1),len(string2))):
    if string1[i] == string2[i]:
      count += 1
  return count

You could implement it with the zip built-in function (look at python documentation).

answered Feb 28, 2016 at 18:16

Sci Prog

2,6911 gold badge12 silver badges19 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

markzzzz Over a year ago

Thanks for help and explanation. I think I understand it now. Wasn't thought about the minimum length. ;)

Collectives™ on Stack Overflow

Any way to count overlapped strings within another string?

1 Answer 1

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related