392. Is Subsequence

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?

思路：逐一比较

代码1：

class Solution {
public:
    bool isSubsequence(string s, string t) {
        if(s.size()>t.size()){return false;}
        auto tp=t.begin();
        for(char ch:s){
            if(find(tp,t.end(),ch)!=t.end()){
                auto temp=tp;
                tp=find(temp,t.end(),ch)+1;
            }
            else{return false;}
        }
        return true;
    }
};

代码2：

class Solution {
public:
    bool isSubsequence(string s, string t) {
        if(s.size()>t.size()){return false;}
        int j=0,i=0;
        while((i<s.size())&&(j<t.size())){
            if(s[i]==t[j]){
                i++;
                j++;
            }
            else{j++;}
        }
        
        if(i==s.size()){return true;}
        else{return false;}
    }
};