Given two strings
t, check if
s is a subsequence of
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e.,
"ace" is a subsequence of
"aec" is not).
s = "abc", t = "ahbgdc"
s = "axc", t = "ahbgdc"
0 <= s.length <= 100
0 <= t.length <= 104
tconsist only of lowercase English letters.
Follow up: If there are lots of incoming
, ..., sk where
k >= 109, and you want to check one by one to see if
t has its subsequence. In this scenario, how would you change your code?
class Solution: def isSubsequence(self, s: str, t: str) -> bool: sIdx = 0 tIdx = 0 while sIdx < len(s) and tIdx <len(t): if s[sIdx] == t[tIdx]: sIdx += 1 tIdx += 1 return sIdx == len(s)