难度: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).
这道题只考虑字符串子串的顺序 而不考虑是否相连接 那么就直接外定义一个index作为判定字符串的下标 再进行遍历就可以解决
代码如下:
bool isSubsequence(string s, string t) {
if(s.size()==0)
return 1;
int index=0;
for(int i=0;i<t.size();i++)
{
if(index<s.size()&&i==t.size()-1&&s[index]!=t[i])
return false;
if(s[index]==t[i]){
if(index==s.size()-1)
return true;
else
index+=1;
}
}
return false;
}