【leetcode】392. Is Subsequence

题目：
Given a string s and a string t, check if s is subsequence of t.

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).

---

思路：
两字符串直接比较即可。

---

代码实现：

// 思路：就是从头到尾同时比较s和t的每一个字符。若不相等就继续向后寻找。
class Solution {
public:
    bool isSubsequence(string s, string t) {
        if (s.size() > t.size()) return false;
        
        int i = 0, j = 0;
        
        while (i < s.size() && j < t.size()){
            if (s[i] == t[j]) 
                ++i, ++j;
            else 
                ++j;    
        }
        
        return i == s.size();
    }
};