Leecode 392. Is Subsequence

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

Follow up:
If there are lots of incoming S, say S1, S2, … , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?

Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.

Example 1:

Input: s = “abc”, t = “ahbgdc”
Output: true
Example 2:

Input: s = “axc”, t = “ahbgdc”
Output: false

Constraints:

0 <= s.length <= 100
0 <= t.length <= 10^4
Both strings consists only of lowercase characters.

The first solution:
Using 2 pointers,if s[i]==t[j] ,increase i and j index,else increase j index.
Code:

// An highlighted block
class Solution {
public:
    bool isSubsequence(string s, string t) {
        int sinx=0;
        for(int i=0;i<t.size() && sinx<s.size();i++){
            if(s[sinx]==t[i])
                sinx++;
        }
        return sinx==s.size();
    }
};

The second solution:
Using dp method, the induction function is :
dp[i][j]=dp[i-1][j-1] if s[i]==t[j];
dp[i][j]=dp[i][j-1] if s[i]!=t[j]
Code:

class Solution {
public:
   bool isSubsequence(string s, string t) {
       int sl=s.size();
       int tl=t.size();
       vector<vector<bool>> dp(sl+1,vector<bool>(tl+1,false));
       for(int j=0;j<=tl;j++)
           dp[0][j]=true;
       for(int i=1;i<=sl;i++){
           for(int j=1;j<=tl;j++){
               if(s[i-1]==t[j-1])
                   dp[i][j]=dp[i-1][j-1];
               else
                 dp[i][j]=dp[i][j-1];  
           }
       }
       return dp[sl][tl];
   }
};

The third solution(follow up):
**Using binary search, we initiate a index list for t’s characters .find the first index of s’s characters which is larger than i-1’s index **
Code:

class Solution {
public:
    bool isSubsequence(string s, string t) {
        vector<vector<int>> idx(26,vector<int>());
        for(int i=0;i<t.size();i++){
            idx[t[i]-'a'].push_back(i);
        }
        int start=-1;
        for(int i=0;i<s.size();i++){
            auto idxlist=idx[s[i]-'a'];
            auto it=upper_bound(idxlist.begin(),idxlist.end(),start);
            if(it==idxlist.end())
                return false;
            start=*it;
        }
        return true;
    }
};