28. Implement strStr()

Author: coderbean

src/leetcode/_28_/Main.java

@@ -0,0 +1,12 @@
+package leetcode._28_;
+
+/**
+ * Created by zhangbo54 on 2019-03-04.
+ */
+public class Main {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.strStr("hello", "ll"));
+    }
+}
+

src/leetcode/_28_/Solution.java

@@ -0,0 +1,7 @@
+package leetcode._28_;
+
+class Solution {
+    public int strStr(String haystack, String needle) {
+        return haystack.indexOf(needle);
+    }
+}

src/leetcode/_28_/solution.md

@@ -0,0 +1,42 @@
+### [28\. Implement strStr()Copy for Markdown](https://leetcode.com/problems/implement-strstr/)
+
+Difficulty: **Easy**
+
+
+Implement .
+
+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  and Java's .
+
+
+#### Solution
+
+Language: **Java**
+
+```java
+class Solution {
+    public int strStr(String haystack, String needle) {
+        return haystack.indexOf(needle);
+    }
+}
+```
+![](https://ws1.sinaimg.cn/large/006tKfTcgy1g0zym83rlkj31180n40wa.jpg)