392.leetcode Is Subsequence (medium)[判断一个字符串是否是另一个字符串的子串]

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?

Subscribe to see which companies asked this question

思路是这样的，针对子串首先遍历原串检查子串中每个不重复字符所在原串的位置数组记录下来，然后从开始遍历子串的每个字符的位置找到第一个大于前一个字符所在位置的就是成功的，这里由于之前是按照顺序遍历的（因此默认位置是按照从小到大排序的，因此只需要找到第一个大于之前字符位置的位置即可）。最后如果完成了子串字符个次的遍历，那么就是成功的，否则就是不成功的。

class Solution {
public:
    bool isSubsequence(string s, string t) {
        //首先对t中的每个字符在s的进行一次扫描，记录下相应的位置并且检测是否都存在
        if(s.length() == 0) return true;
        map<char,vector<int> > status;
        int valid = 0;
        set<char> letter;
        for(int i = 0;i<s.length();i++)
              letter.insert(s[i]);
        set<char>::iterator iter = letter.begin();
        for( ;iter != letter.end();iter++)
            for(int j = 0;j<t.length();j++)
            {
                if(*iter == t[j])
                {
                     status[t[j]].push_back(j);   
                     ++valid;
                }
            }
            if(valid<s.length())
               return false;
        int last = 0;
        int flag = 0;
        for(int i = 0;i<s.length();i++)
        {
            char c = s[i];
            vector<int> temp = status[c];
            for(int i = 0;i<temp.size();i++)
            {
                if(last<= temp[i])   
                {
                    last = temp[i];
                    temp.erase(temp.begin()+i);
                    status[c] = temp;
                    flag++;
                    break;
                }
            }
        }
        if(flag == s.length()) return true;
        else return false;
    }
};