LeetCode-Implement strStr()

最新推荐文章于 2019-12-27 22:29:36 发布

原创最新推荐文章于 2019-12-27 22:29:36 发布 · 189 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Java

LeetCode 专栏收录该内容

306 篇文章

订阅专栏

本文详细解析了如何实现strStr()函数，该函数用于查找一个字符串在另一个字符串中首次出现的位置。通过遍历haystack字符串并比较长度为needle长度的子串，可以找到匹配的起始位置。特别地，当needle为空字符串时，根据C和Java的标准，函数返回0。

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

Description：
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().

题意：实现字符串函数strStr()的功能，返回字符串haystack第一次出现字符串needle的位置，如果没有则返回-1；对于needle字符串为空的情况则返回0；

解法：只要遍历字符串haystack，每次计算其长度为needle.length()的字串是否和needle相等即可；

Java

class Solution {
    public int strStr(String haystack, String needle) {
        if (needle.length() == 0) return 0;
        if (needle.length() > haystack.length()) return -1;
        int len = needle.length();
        for (int i = 0; i <= haystack.length() - needle.length(); i++) {
            while (i < haystack.length() && haystack.charAt(i) != needle.charAt(0)) i++;
            if (i > haystack.length() - needle.length()) break;
            if (needle.equals(haystack.substring(i, i + needle.length()))) return i;
        }
        return -1;
    }
}