<LeetCode><Easy> 28 Remove Element

Implement strStr().

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

#Python2  36ms

class Solution(object):
def strStr(self, haystack, needle):
"""
:type haystack: str
:type needle: str
:rtype: int
"""
ne,ha=len(needle),len(haystack)
if ne>ha:return -1
for i in range(ha-ne+1):
if haystack[i:i+ne]==needle:return i
return -1