No28.java

packageAlgorithm.leetcode.String;

publicclassNo28 {

publicintstrStr(Stringhaystack, Stringneedle) {
if (needle == "" || needle == null) {
return0;
 }
if (haystack.contains(needle)) {
returnhaystack.indexOf(needle);
 }
return -1;
 }

publicintstrStr02(Stringhaystack, Stringneedle) {
inthayLen = haystack.length(), needLen = needle.length();
if (hayLen < needLen) {
return -1;
 } elseif (needLen == 0) {
return0;
 }
intdum = hayLen - needLen;
for (inti = 0; i <= dum; i++) {
if ((haystack.substring(i, i + needLen)).equals(needle)) {
returni;
 }
 }
return -1;
 }

}