[Leetcode] 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.

按照简单的判断是否是子串的问题方法解决，题目标注了可能可以通过dp或者其它BFS方法解决？

代码为：

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