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

解法一

常规做法，遍历haystack，用两个索引指着haystack和needle如果第二个索引等于needle长度则返回i的值，若不等于则继续遍历haystack，若没有符合的则返回-1

public int strStr(String haystack, String needle) {
		if(needle==null||needle.length()==0)
			return 0;
		int curindex=0;
		for(int i=0;i<=haystack.length()-needle.length();i++)
		{
			int start=i;
			while(start<haystack.length()&&curindex<needle.length()&&haystack.charAt(start)==needle.charAt(curindex))
			{
				start++;
				curindex++;
			}
			if(start!=i)
			{
				if(curindex==needle.length())
					return i;
				else
					curindex=0;
			}
		}
		return -1;   
    }

Runtime: 4 ms, faster than 76.87% of Java online submissions for Implement strStr().
Memory Usage: 38.6 MB, less than 24.20% of Java online submissions for Implement strStr().

简洁一点的代码

public int strStr(String haystack, String needle){
		if(needle.length()==0||needle==null)
			return 0;
		int n=haystack.length();
		int m=needle.length();
		if(n<m)
			return -1;
		for(int i=0;i<=n-m;i++)
		{
			int j=0;
			while(j<needle.length()&&haystack.charAt(i+j)==needle.charAt(j))
			{
				j++;
			}
			if(j==m)
				return i;
		}
			
		return -1;
	}

Runtime: 4 ms, faster than 76.87% of Java online submissions for Implement strStr().
Memory Usage: 38.5 MB, less than 37.86% of Java online submissions for Implement strStr().