-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDSA14.py
More file actions
50 lines (34 loc) · 1012 Bytes
/
DSA14.py
File metadata and controls
50 lines (34 loc) · 1012 Bytes
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
# Question ---->
# Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
# Example 1:
# Input: haystack = "sadbutsad", needle = "sad"
# Output: 0
# Explanation: "sad" occurs at index 0 and 6.
# The first occurrence is at index 0, so we return 0.
# Example 2:
# Input: haystack = "leetcode", needle = "leeto"
# Output: -1
# Explanation: "leeto" did not occur in "leetcode", so we return -1.
# Constraints:
# 1 <= haystack.length, needle.length <= 104
# haystack and needle consist of only lowercase English characters.
# Answer ---->
class Solution(object):
def strStr(self, haystack, needle):
if not needle:
return 0
return haystack.find(needle)
return
"""
:type haystack: str
:type needle: str
:rtype: int
"""
# Result ---->
# Your input:
# "sadbutsad"
# "sad"
# Output:
# 0
# Expected:
# 0