-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNeedle In Haystack.py
More file actions
44 lines (33 loc) · 1.18 KB
/
Needle In Haystack.py
File metadata and controls
44 lines (33 loc) · 1.18 KB
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
#https://leetcode.com/problems/implement-strstr/
"""
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Example 1:
Input: haystack = "hello", needle = "ll"
Output: 2
Example 2:
Input: haystack = "aaaaa", needle = "bba"
Output: -1
Clarification:
What should we return when needle is an empty string? This is a great question to ask during an interview.
For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and
Java's indexOf().
"""
class Solution(object):
def strStr(self, haystack, needle):
"""
:type haystack: str
:type needle: str
:rtype: int
"""
if not needle or not haystack:
# Checks for either parameter to be empty
return 0
for i in range(0,len(haystack)-len(needle)):
# Checks through the array in intervals of up to the length of the needle to see if it is present
if haystack[i:i+len(needle)] == needle:
# If match, return i
return i
return -1
test = Solution()
print(test.strStr("hello", "ll"))