[leetcode]392. Is Subsequence

Analysis

早鴨—— [每天刷題並不難0.0]

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

Implement

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

            else
                j++;
        }
        if(i == lens)
            return true;
        return false;
    }
};