Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Latest commit

 

History

History
History
50 lines (49 loc) · 1.53 KB
/

ImplementStr.java

File metadata and controls

50 lines (49 loc) · 1.53 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
package com.yangchd.leetcode.easy;
/**
* @author yangchd 2018/6/25.
*
* 28. Implement strStr()
* 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 strstr() and Java's indexOf().
*
*/
public class ImplementStr {
class Solution {
public int strStr(String haystack, String needle) {
int hlength = haystack.length();
int nlength = needle.length();
if (hlength < nlength) {
return -1;
}
if (nlength == 0) {
return 0;
}
for (int i = 0; i < hlength - nlength + 1; i++) {
if (haystack.charAt(i) == needle.charAt(0)) {
boolean flag = true;
for (int y = 1; y < nlength; y++) {
if (haystack.charAt(i + y) != needle.charAt(y)) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
}
return -1;
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.