일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- leetcode
- programmers
- HDFS
- 아파치 하둡
- Apache Hadoop
- Hadoop
- Spark
- 아파치 스파크
- 스파크
- 도커
- 리트코드
- docker
- 하둡
- 분산처리
- 코딩테스트
- 우선순위큐
- 이진탐색
- 빅데이터
- Apache Spark
- 딕셔너리
- 알고리즘
- 데이터 엔지니어링
- 오블완
- 분산
- Data Engineering
- 파이썬
- 프로그래머스
- 티스토리챌린지
- heapq
- Python
- Today
- Total
래원
[LeetCode] 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence - Python 본문
[LeetCode] 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence - Python
Laewon Jeong 2024. 12. 2. 15:56
난이도: Easy
문제 설명
Given a sentence that consists of some words separated by a single space, and a searchWord, check if searchWord is a prefix of any word in sentence.
Return the index of the word in sentence (1-indexed) where searchWord is a prefix of this word. If searchWord is a prefix of more than one word, return the index of the first word (minimum index). If there is no such word return -1.
A prefix of a string s is any leading contiguous substring of s.
문제 예제
Example 1:
Input: sentence = "i love eating burger", searchWord = "burg"
Output: 4
Explanation: "burg" is prefix of "burger" which is the 4th word in the sentence.
Example 2:
Input: sentence = "this problem is an easy problem", searchWord = "pro"
Output: 2
Explanation: "pro" is prefix of "problem" which is the 2nd and the 6th word in the sentence, but we return 2 as it's the minimal index.
Example 3:
Input: sentence = "i am tired", searchWord = "you"
Output: -1
Explanation: "you" is not a prefix of any word in the sentence.
제한 사항
- 1 <= sentence.length <= 100
- 1 <= searchWord.length <= 10
- sentence consists of lowercase English letters and spaces.
- searchWord consists of lowercase English letters.
✏️ Solution(솔루션)
class Solution:
def isPrefixOfWord(self, sentence: str, searchWord: str) -> int:
words = sentence.split()
n = len(searchWord)
for i, word in enumerate(words):
word_prefix = word[:n]
if word_prefix == searchWord:
return i+1
return -1
sentence를 공백을 기준으로 split 해주어 sentence에 있는 word를 저장하는 words라는 리스트를 생성했다.
그 후 모든 words에 저장된 word에 대해 searchWord의 길이 만큼 prefix를 구했고, 만약 이게 searchWord와 같다면 현재 위치의 +1한 값을 return 하였다.
모든 word를 확인했음에도 조건을 만족하지 않는다면 -1을 return하도록 했다.
[LeetCode] 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
'알고리즘 > LeetCode' 카테고리의 다른 글
[LeetCode] 2825. Make String a Subsequence Using Cyclic Increments (Python) (0) | 2024.12.05 |
---|---|
[LeetCode] 2109. Adding Spaces to a String - Python (0) | 2024.12.03 |
[LeetCode] 1346. Check If N and Its Double Exist - Python (0) | 2024.12.01 |
[LeetCode] 3243. Shortest Distance After Road Addition Queries I - Python (0) | 2024.11.28 |
[LeetCode] 2924. Find Champion II - Python (0) | 2024.11.27 |