标签：
Problem Definition:
Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Solution: 字符串匹配问题。brute force、KMP 、Rabin-Karp, KMP, and the Boyer- Moore algorithm.
LeetCode#28 Implement strStr()
标签：
原文地址：http://www.cnblogs.com/acetseng/p/4674430.html
