leetcode -- 392. Is Subsequence

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

Example 1:
s = "abc", t = "ahbgdc"

Return true.

Example 2:
s = "axc", t = "ahbgdc"

Return false.

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/is-subsequence
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

我的思路1：（暴力）

1、本想着暴力可能不会过，没想到还过了，就是速度有点低...纯暴力枚举。

2、双指针，一个指向t，一个指向s，然后进行比对。

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int ssize = s.size();
        int tsize = t.size();
        int index = 0, i = 0;
        bool flag1 = true;
        for(i; i < tsize; i++){
            if(index == ssize && i < tsize){  //还没到最后，找到了全部s，flag1 = true
                break;
            }            
            if(t[i] != s[index]) continue;
            else{ 
                index++;
            } 
        }
        if(index < ssize && i == tsize){ //i到了最后，index没找完
            flag1 = false;
        }
        
        if(flag1) return true;
        else return false;
        
    }
};

 

思路2：（dp）

1、很奇怪，借鉴了别人的dp代码，但是速度内存都没双指针来得快?

2、说下思路，dp[i][j]表示s的i号位和t的j号位之间的LCS长度，最后判断到最后是否是s的长度即可

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