반응형
Q. Given a sentence that consists of some words separated by a single space, and a searchWord. You have to check if searchWord is a prefix of any word in sentence. Return the index of the word in sentence where searchWord is a prefix of this word (1-indexed). 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.
let isPrefixOfWord = function(sentence, searchWord) {
let count = 0;
if(sentence.includes(searchWord)===false) return -1;
let newSentence = sentence.split(" ");
for(let i=0; i<newSentence.length; i++){
if(newSentence[i].includes(searchWord)===true && newSentence[i].indexOf(searchWord) === 0){
return i+1;
}
count++;
}
if(count===newSentence.length) return -1;
};
반응형
'DEVELOP > Algorithm' 카테고리의 다른 글
[leetcode] 1748. Sum of Unique Elements (0) | 2021.02.23 |
---|---|
[leetcode] 1720. Decode XORed Array (0) | 2021.02.22 |
[leetcode] 1431. Kids With the Greatest Number of Candies (0) | 2021.02.22 |