# 编写一个函数findstr(),该函数统计一个长度为2的子字符串在另一个字符串中出现的次数
def findstr(desStr, subStr):
count = 0
n = len(desStr)
for i in range(n):
if desStr[i] == subStr[0] and desStr[i+1] == subStr[1]:
count += 1
return count
desStr = 'hello world hello'
subStr = 'll'
print(findstr(desStr, subStr))
D:\Python\Python36\python.exe D:/Python_test/day_lesson/test.py
2
Process finished with exit code 0