28. Implement strStr() leetcode Python new season 2016

原创于 2016-01-12 11:43:21 发布 · 423 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍如何实现strStr()函数，用于在主字符串中查找子字符串的首次出现位置，若未找到则返回-1。通过实例演示和代码解析，深入理解字符串操作与算法应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Implement strStr().

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

Show Company Tags

Show Tags

Show Similar Problems

python string is immutable .. have to do sth not optimized. may change it in the future.

class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """
        if haystack == "" and needle == "":
            return 0
        if haystack == "" and needle != "":
            return -1
        if needle == "":
            return 0
        newstr = haystack.split(needle)
        if len(newstr[0]) == len(haystack):
            return -1
        return len(newstr[0])