392. Is Subsequence

Given a string s and a stringt, check ifs is subsequence oft.

You may assume that there is only lower case English letters in boths andt.t is potentially a very long (length ~= 500,000) string, ands 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.

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