leetcode ~~~~~~~~(我也不知道这个题号了。。)

原题：

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?

bool isSubsequence(char* s, char* t) {
    int len=strlen(s);
    for(int n=0;n<len;n++)
    {
        char* temp;
        temp=(char*)malloc(sizeof(char)*2);
        *temp=*(s+n);
        *(temp+1)='\0';
        if(strstr(t,temp)==NULL)
        {
            return false;
        }
        {
            t=strstr(t,temp)+1;
        }
    }
    return true;
}

这个写的我一脸尴尬。。。

开始的想法就是这个，但是基于昨天的经验，还是想找找规律什么的，有没有什么神通。。

结果都说没有。。。

唉。。。

还是太年轻了。。