LeetCode 392. 判断子序列

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int m = s.size();
        int n = t.size();
        int i = 0, j = 0;
        while(i < m && j < n){
            if(s[i] == t[j]){
                ++i;    //匹配成功则s字符串往后移一个
            }
            ++j;    //不管匹配成功与否t字符串都往后移一个
        }
        return i == m;  //s字符串遍历完则表示匹配成功
    }
};