-
Notifications
You must be signed in to change notification settings - Fork 2
/
FindAString.py
54 lines (48 loc) · 1.37 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
# 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
#
#
# 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
# Concept
#
# Some string processing examples, such as these, might be useful.
# There are a couple of new concepts:
# In Python, the length of a string is found by the function len(s), where is the string.
# To traverse through the length of a string, use a for loop:
#
# for i in range(0, len(s)):
# print (s[i])
# A range function is used to loop over some length:
#
# range (0, 5)
# Here, the range loops over to . is excluded.
def count_substring(string, sub_string):
count = 0;
for i in range(len(string)):
if (string(sub_string)):
count += 1
return count
if __name__ == '__main__':
string = input().strip()
sub_string = input().strip()
count = count_substring(string, sub_string)
print(count)