-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfindaString.py
55 lines (46 loc) · 1.33 KB
/
findaString.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#!/bin/env python3
#
# https://www.hackerrank.com/challenges/find-a-string
#
# In this challenge, the user enters a string and a substring.
# You have to print the number of times that the substring occurs in the
# given string. String traversal will take place from left to right, not
# from right to left.
# NOTE: String letters are case-sensitive.
#
# Input Format
# The first line of input contains the original string.
# The next line contains the substring.
# Constraints
# 1<= len(string) <= 200
# Each character in the string is an ascii character.
# Output Format
# Output the integer number indicating the total number of occurrences
# of the substring in the original string.
# Sample Input
# ABCDCDC
# CDC
# Sample Output
# 2
import re
debug = True
def dprint(s):
if debug:
print(repr(s))
def count_substring(string, substring):
"""
Count number of times substring in string,
using slices of substring length
over the range of the string length.
Return total count.
Note: overlaps OK (string.count(s) is non-overlapping)
"""
total = 0
matches = re.findall('(?='+substring+')', string)
dprint(matches)
return len(matches)
if __name__ == '__main__':
string = input().strip()
sub_string = input().strip()
count = count_substring(string, sub_string)
print(count)