[leetcode] 392. Is Subsequence

Description

Given a string s and a string t, check if s is subsequence of t.

You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100).

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, “ace” is a subsequence of “abcde” while “aec” is not).

Example 1:

s = "abc", t = "ahbgdc"

Return true.

Example 2:

s = "axc", t = "ahbgdc"

Return false.

Follow up:
If there are lots of incoming S, say S1, S2, … , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?

分析

题目的意思是：判断s是否是t的子序列。

• 问题比较简单，遍历一次+判断，代码简洁易懂，直接看代码吧。

C++实现

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int m=s.length();
        int n=t.length();
        int s1=0;
        int t1=0;
        while(s1<m&&t1<n){
            if(s[s1]==t[t1]){
                s1++;
                t1++;
            }else{
                t1++;
            }
        }
        return s1==m;
    }
};

Python实现

class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        m = len(s)
        n = len(t)
        i = 0
        j = 0
        while i<m and j<n:
            if s[i]==t[j]:
                i+=1
                j+=1
            elif s[i]!=t[j]:
                j+=1
        return i==m

参考文献

[LeetCode] Is Subsequence 是子序列