Leetcode 1961. Check If String Is a Prefix of Array

Posted SnailTyan

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode 1961. Check If String Is a Prefix of Array相关的知识,希望对你有一定的参考价值。

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

**解析:**Version 1,遍历数组中的字符串,同时遍历s,如果数组中的字符不等于对应位置的字符,直接返回False,当s遍历结束时,判断数组中当前位置的字符串是否遍历完成,如果数组遍历结束,判断字符串s是否遍历完成。Version 2直接按单词比较。

  • Version 1
class Solution:
    def isPrefixString(self, s: str, words: List[str]) -> bool:
        n = len(s)
        i = 0
        for word in words:
            for j in range(len(word)):
                if s[i] == word[j]:
                    i += 1
                else:
                    return False
                if i == n:
                    return j == len(word) - 1
        return i == n
  • Version 2
class Solution:
    def isPrefixString(self, s: str, words: List[str]) -> bool:
        n = len(s)
        i = 0
        for word in words:
            m = len(word)
            if s[i:i+m] == word:
                i += m
            else:
                return False
            if i == n:
                return True
        return i == n

Reference

  1. https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/

以上是关于Leetcode 1961. Check If String Is a Prefix of Array的主要内容,如果未能解决你的问题,请参考以下文章

1961-Check If String Is a Prefix of Array

Leetcode-1003 Check If Word Is Valid After Substitutions(检查替换后的词是否有效)

LeetCode --- 1437. Check If All 1‘s Are at Least Length K Places Away 解题报告

LeetCode --- 1437. Check If All 1‘s Are at Least Length K Places Away 解题报告

leetcode1461. Check If a String Contains All Binary Codes of Size K

LeetCode 1346. Check If N and Its Double Exist