|
|
- class find_sub_str:
- def strStr(self, haystack: str, needle: str) -> int:
- if len(needle) > len(haystack):
- return -1
- if needle == haystack:
- return 0
-
- len_str = len(needle)
- pt = 0
- while pt <= (len(haystack) - len(needle)):
- if haystack[pt:pt+len_str] == needle:
- return pt
- else:
- pt += 1
- return -1
-
- func = find_sub_str()
- haystack = str(input("请输入长字符串："))
- needle = str(input("请输入被查找字符串："))
- res = func.strStr(haystack, needle)
- print("result = {}".format(res))
|
|
