文章作者: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 = 0for word in words:for j in range(len(word)):if s[i] == word[j]:i += 1else:return Falseif i == n:return j == len(word) - 1return i == n
- Version 2
class Solution:def isPrefixString(self, s: str, words: List[str]) -> bool:n = len(s)i = 0for word in words:m = len(word)if s[i:i+m] == word:i += melse:return Falseif i == n:return Truereturn i == n
Reference
- https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/