jasonkwan12的博客

我的博客

LeetCode 28. Implement strStr() Java

水题


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


class Solution {
    public int strStr(String haystack, String needle) {
        int lenA=haystack.length();
        int lenB=needle.length();
        if(lenA<lenB)
            return -1;
        int index=0;
        while(true){
            String str=haystack.substring(index,index+lenB);
            if(needle.equals(str))
                return index;
            index++;
            if((index+lenB)>lenA)
                break;
        }
        return -1;
    }
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/jasonkwan12/article/details/79951945
个人分类: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

LeetCode 28. Implement strStr() Java

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭