LeetCode392. 判断子序列

原题链接

1 class Solution:
2     def isSubsequence(self, s: str, t: str) -> bool:
3         lens,lent = len(s),len(t)
4         i = j = 0
5         while i < lens and j < lent:
6             if s[i] == t[j]:
7                 i += 1
8             j += 1
9         return i == lens

标签：判断,return,原题,len,lens,LeetCode392,str,lent,序列
来源： https://www.cnblogs.com/lj95/p/14320664.html