{"id":6810,"date":"2020-05-23T22:13:48","date_gmt":"2020-05-24T05:13:48","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=6810"},"modified":"2020-05-23T22:15:23","modified_gmt":"2020-05-24T05:15:23","slug":"leetcode-1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/string\/leetcode-1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence"},"content":{"rendered":"\n

Given a sentence<\/code> that consists of some words separated by a single space<\/strong>, and a searchWord<\/code>.<\/p>\n\n\n\n

You have to check if searchWord<\/code> is a prefix of any word in sentence<\/code>.<\/p>\n\n\n\n

Return the index of the word<\/em> in sentence<\/code> where searchWord<\/code> is a prefix of this word (1-indexed<\/strong>).<\/p>\n\n\n\n

If searchWord<\/code> is a prefix of more than one word, return the index of the first word (minimum index)<\/strong>. If there is no such word return -1<\/strong>.<\/p>\n\n\n\n

A prefix<\/strong> of a string S<\/code> is any leading contiguous substring of S<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> sentence = \"i love eating burger\", searchWord = \"burg\"\nOutput:<\/strong> 4\nExplanation:<\/strong> \"burg\" is prefix of \"burger\" which is the 4th word in the sentence.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> sentence = \"this problem is an easy problem\", searchWord = \"pro\"\nOutput:<\/strong> 2\nExplanation:<\/strong> \"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.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> sentence = \"i am tired\", searchWord = \"you\"\nOutput:<\/strong> -1\nExplanation:<\/strong> \"you\" is not a prefix of any word in the sentence.\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> sentence = \"i use triple pillow\", searchWord = \"pill\"\nOutput:<\/strong> 4\n<\/pre>\n\n\n\n
Example 5:<\/strong><\/p>\n\n\n\n
Input:<\/strong> sentence = \"hello from the other side\", searchWord = \"they\"\nOutput:<\/strong> -1\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= sentence.length <= 100<\/code><\/li>
  • 1 <= searchWord.length <= 10<\/code><\/li>
  • sentence<\/code> consists of lowercase English letters and spaces.<\/li>
  • searchWord<\/code> consists of lowercase English letters.<\/li><\/ul>\n\n\n\n
    Solution 1: Brute Force<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \nclass Solution {\npublic:\n  int isPrefixOfWord(string sentence, string searchWord) {\n    const int n = sentence.size();\n    const int l = searchWord.size();\n    int word = 0;\n    for (int i = 0; i <= n - l; ++i) {\n      if (i == 0 || sentence[i - 1] == ' ') {\n        ++word;\n        bool valid = true;\n        for (int j = 0; j < l && valid; ++j)\n          valid = valid && (sentence[i + j] == searchWord[j]);\n        if (valid) return word;      \n      }\n    }\n    return -1;\n  }\n};\n<\/pre>\n<\/div><\/div>\n\n\n\n
    <\/p>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[47],"tags":[222,97,4,109],"class_list":["post-6810","post","type-post","status-publish","format-standard","hentry","category-string","tag-easy","tag-prefix","tag-string","tag-word","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6810","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=6810"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6810\/revisions"}],"predecessor-version":[{"id":6813,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6810\/revisions\/6813"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=6810"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=6810"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=6810"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}