@@ -0,0 +1,859 @@
+%22%22%22Leetcode 28. Implement strStr()%0AEasy%0A%0AURL: https://leetcode.com/problems/implement-strstr/%0A%0AImplement strStr().%0A%0AReturn the index of the first occurrence of needle in haystack, %0Aor -1 if needle is not part of haystack.%0A%0AExample 1:%0A%0AInput: haystack = %22hello%22, needle = %22ll%22%0AOutput: 2%0AExample 2:%0A%0AInput: haystack = %22aaaaa%22, needle = %22bba%22%0AOutput: -1%0AClarification:%0A%0AWhat should we return when needle is an empty string? %0AThis is a great question to ask during an interview.%0A%0AFor the purpose of this problem, we will return 0 when needle is an empty string. %0AThis is consistent to C's strstr() and Java's indexOf().%0A%22%22%22%0A%0Aclass Solution(object):%0A    def strStr(self, haystack, needle):%0A        %22%22%22%0A        :type haystack: str%0A        :type needle: str%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc028_implement_strstr.py