【题解】392. 判断子序列 （字符串、双指针、队列）

https://leetcode.cn/problems/is-subsequence/description/?envType=study-plan-v2&envId=top-interview-150

1. 双指针

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

        return i == m;
    }
};

1. 队列

class Solution {
public:
    bool isSubsequence(string s, string t) {
        queue<int> q;
        for (auto e : s)
        {
            q.push(e);
        }
        for (auto e : t)
        {
            if (e == q.front())
            {
                q.pop();
            }
        }
        return q.empty();
    }
};