Shulou(Shulou.com)06/02 Report--

How to judge the subsequence in LeetCode, in view of this problem, this article introduces the corresponding analysis and solution in detail, hoping to help more partners who want to solve this problem to find a more simple and feasible method.

Idea: double pointers do not need the characters in s to appear continuously in t, so you only need to judge whether they all appear in t from the first character of s. Two pointers are set here, the first pointer I points to the element to be judged in t, and the second pointer j points to the element in s to confirm whether it exists in t. When the element pointed to by j exists in t, j moves backward. Class Solution: def isSubsequence (self, s: str, t: str)-> bool: if len (s) = = 0: return True iTun0 juni0 while I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.