leetcode刷题之旅（28）Implement strStr()

题目描述

Implement strStr().

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

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

样例

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

Input: haystack = "aaaaa", needle = "bba"
Output: -1

思路分析

返回字符串中字符出现的下标即可。当然，看到这道题第一反应是indexOf，试了一下还真成功了，，，皮这一下很开心~

代码

方法一不知道为啥 ，编译器上可以运行，leetcode提示我越界

public  static int strStr(String haystack, String needle) {
		if (needle == "") {
			return 0;
		}
		if (haystack=="" || haystack.length() < needle.length()) {
			return -1;
		}
		for (int i = 0; i < haystack.length(); i++) {
			for (int j = 0; haystack.charAt(i) == needle.charAt(j); j++,i++) {
				if (j == needle.length()-1) {
					return (i-needle.length()+1);
				}
				if (i>haystack.length()-1 ) {
					return -1;
				}
			}
		}
		return -1;   
    }

方法二：瞻仰一下讨论区大佬优雅的代码，虽然复杂度有点高了

public int strStr(String haystack, String needle) {
  for (int i = 0; ; i++) {
    for (int j = 0; ; j++) {
      if (j == needle.length()) return i;
      if (i + j == haystack.length()) return -1;
      if (needle.charAt(j) != haystack.charAt(i + j)) break;
    }
  }
}