https://leetcode.com/problems/implement-strstr/

https://leetcode.com/problems/implement-strstr/

很简单 先找needle串的头和haystack相同的位置 

如果连头都不一样就肯定不是 

相同再比较后面的每一位 

有一些特殊情况 

长度needle或者haystack可能是空串 单独处理

 

class Solution:
    # @param {string} haystack
    # @param {string} needle
    # @return {integer}
    def strStr(self, haystack, needle):
        lenn=len(needle)
        lenh=len(haystack)
        i=0
        temp=-1
        if lenn==0 and lenh!=0:
            return 0
        elif lenn==0 and lenh==0:
            return 0
        elif lenn!=0 and lenh==0:
            return -1
        else:
            while i<lenh-lenn+1:
                if haystack[i]==needle[0]:
                    for j in range(lenn):
                        if needle[j]!=haystack[i+j]:
                            break
                        else:
                            if j==lenn-1:
                                temp=i
                                return temp
                i=i+1
            return temp