LeetCode 392 - 判断子序列

class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        sLen, tLen = len(s), len(t)
        # 提前剪枝
        if sLen == 0:
            return True
        if tLen == 0:
            return False
        sCurr, tCurr = 0, 0
        while sCurr < sLen and tCurr < tLen:
            # 相等的时候说明找到了，则字串向前
            if s[sCurr] == t[tCurr]:
                sCurr += 1
            tCurr += 1
        return True if sCurr >= sLen else False