LeetCode 392.IsSequence

问题描述：
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).

思路：与字符串匹配的KMP算法有异曲同工之妙，设定两个指针，分别指向s和t，当指向s的指针在第i位，指向t的指针在第j位不满足时，指向t的指针不需要回溯，而是直接从j+1位开始匹配，因为此时前面的字符串必然不能满足条件。

代码如下

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int i=0,j=0;
        for(j=0;j<t.length() && i<s.length(); j++){
            if(t[j]==s[i]){
                i++;
            }
        }
        return i==s.length();
    }
};

时间复杂度为O(n+m)~O(n)，n为字符串t长度