28. Implement strStr()

最新推荐文章于 2024-01-19 09:45:33 发布

perfect-Ed

最新推荐文章于 2024-01-19 09:45:33 发布

阅读量174

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/intellectualman/article/details/105248508

leetcode 专栏收录该内容

1 篇文章

订阅专栏

本文详细解析了 LeetCode 上的经典题目——实现 strStr() 函数，该函数用于查找子字符串在主字符串中首次出现的位置。通过具体示例，如在字符串 hello 中查找 ll 的位置，以及在字符串 aaaaa 中查找不存在的子串 bba，阐述了解题思路和代码实现。

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

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

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



int strStr(char * haystack, char * needle){
char* ch1, *ch2;
    int i=0,j=0,len_needle;
    len_needle=strlen(needle);
    ch1=haystack;
    ch2=needle;
    while((*ch1 != '\0') && (*ch2 != '\0')){
       
        if((*ch1) == (*ch2)){
            ch2++;
            j++;
        }
        else{
            ch2=needle;
            ch1=ch1-j;
            i=i-j;
            j=0;
        }
        ch1++;    
        i++;
    }
    if(*ch2=='\0'){
        return (i-len_needle);
    }

    return -1;
}