-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathimplement-strstr.cpp
More file actions
66 lines (45 loc) · 1.27 KB
/
implement-strstr.cpp
File metadata and controls
66 lines (45 loc) · 1.27 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//question//
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
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().
Example 1:
Input: haystack = "hello", needle = "ll"
Output: 2
Example 2:
Input: haystack = "aaaaa", needle = "bba"
Output: -1
Example 3:
Input: haystack = "", needle = ""
Output: 0
Constraints:
0 <= haystack.length, needle.length <= 5 * 104
haystack and needle consist of only lower-case English characters.
//solution//
class Solution {
public:
int strStr(string haystack, string needle) {
int h = haystack.size();
int n = needle.size();
if(n==0)
{
return 0;
}
if(h<n)
{
return -1;
}
for(int i=0;i<h;i++)
{
if(i+n<=h)
{string s = haystack.substr(i,n);
if(s==needle)
{
return i;
}
}
}
return -1;
}
};