-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathstrStr.js
34 lines (24 loc) · 880 Bytes
/
strStr.js
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
/*
https://leetcode.com/problems/implement-strstr/description/
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().
*/
const strStr = function(haystack, needle) {
if (needle.length === 0) return 0;
if (haystack.length < needle) return -1;
for (let i = 0; i < haystack.length; i++) {
if (haystack.substr(i, needle.length) === needle) {
return i;
}
}
return -1;
};