s0028_implement_strstr().go

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

	Implement strStr().

	Given two strings needle and haystack, 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().
*/

package solutions

func strStr(haystack, needle string) int {
	for i := 0; i <= len(haystack)-len(needle); i++ {
		if haystack[i:i+len(needle)] == needle {
			return i
		}
	}
	return -1
}