Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Subscribe to see which companies asked this question
注释掉的是流氓版本
实现的就是两个指针,进行比较,O(l1*l2)
class Solution(object):
def strStr(self, haystack, needle):
s1 = haystack
s2 = needle
l1 = len(s1)
l2 = len(s2)
if s2 == '':
return 0
if l1 < l2:
return -1
if s1 == s2:
return 0
for i in xrange(l1 - l2 + 1):
flag = 0
for j in xrange(l2):
#print s1[i + j],s2[j]
if s1[i+j] != s2[j]:
flag = 1
break
if flag == 0:
return i
#print ''
return -1
'''
try:
return s1.index(s2)
except:
return -1
'''