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中的每个字符是否都出现在字符串t中。具体做法是两个字符串都从下标为0开始,如果字符串s当前位置的字符和字符串t当前位置的字符相同,则字符串s和字符串t的下标都加1,同时计数值加1,否则只将字符串t的下标加1。如果将字符串s或字符串t中的一个扫描一遍之后计数值不等于(小于)字符串s的长度,则字符串s不是字符串t的子序列,否则字符串s是字符串t的子序列。时间复杂度为O(n),其中n为字符串s的长度和字符串t的长度中较大的一个。
class Solution {
public:
bool isSubsequence(string s, string t) {
bool r;
int sn=s.length(),tn=t.length();
int count=0,i=0,j=0;
while(i<sn&&j<tn)
{
if(s[i]==t[j])
{
i++;
j++;
count++;
}
else
{
j++;
}
}
if(count==sn)
r=true;
else
r=false;
return r;
}
};