每日一题 day 55(DP topic)

problem

392. Is Subsequence
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., “ace” is a subsequence of “abcde” while “aec” is not).

Example 1:

Input: s = "abc", t = "ahbgdc"
Output: true

Example 2:

Input: s = "axc", t = "ahbgdc"
Output: false

approach 1

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int idx = 0, cnt = 0;
        for(auto x : s){
            while(idx < t.size()){
                if(t[idx] == x){
                    ++cnt, ++idx;
                    break;
                }
                ++idx;
            }
        }
        if(cnt == s.size()) return true;
        else return false;
    }
};

time complexity : $O(n)$
space complexity : $O(1)$

approach 2 shorter code

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int j=0;
        for(int i=0; i<t.size(); ++i) {
            if(t[i]==s[j]) ++j;
            if(j>=s.size()) return true;
        }
        return j==s.size();
    }
};