今天做的是Is Subsequence
392 | Is Subsequence | 44.3% | 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
.
题目比较简单,这里面分别用一个变量来代表s和t中的字符然后按顺序检索过去就可以了。s[j]代表s的第j个字符,t[i]代表t中第i个字符,我们用for循环来检索t,如果出现了s[j]等于t[i]的情况,那么就将j加1,继续寻找下一位,最后当j的值等于s的长度说明s中的每个字符在t中都出现过了,就可以返回true了。除此之外,还有一种特殊情况,那就是当s和t均为空时直接返回true。
下面上代码:
bool isSubsequence(string s, string t)
{
bool isSub=false;
int sLength=s.length();
int tLength=t.length();
if(tLength==0&&sLength==0)
{
return true;
}
int j=0;
for(int i=0;i<tLength;i++)
{
if(s[j]==t[i])
{
j++;
}
if(j==sLength)
{
isSub=true;
break;
}
}
return isSub;
}