문제
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: 2Example 2:
Input: haystack = "aaaaa", needle = "bba"
Output: -1Clarification:
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().
풀이
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
if len(needle) == 0 :
return 0
else :
return haystack.find(needle)'알고리즘 트레이닝 > LeetCode' 카테고리의 다른 글
| 58. Length of Last Word (0) | 2020.05.08 |
|---|---|
| 35. Search Insert Position (0) | 2020.05.07 |
| 27. Remove Element (0) | 2020.05.06 |
| 26. Remove Duplicates from Sorted Array (0) | 2020.05.05 |
| 20. Valid Parentheses (0) | 2020.05.04 |