【题目描述】
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的开头,如果两指针指向的字符相同则一起下移到下一位,反之则只移动指向字符串t的指针,如果当循环结束指向s的指针没有走到s的结尾处,则说明s不是t的子串。
我本来觉得自己这个做法时间复杂度太高,但ac后翻了下discuss之后发现大家的做法和我差不多。。个人觉得应该是有更精妙的解法的,只能以后再想想了。
【代码】
class Solution {
public:
bool isSubsequence(string s, string t) {
int lens=s.length();
int lent=t.length();
int i=0,j=0;
bool flag=true;
while(i<lens&&j<lent){
if(s[i]==t[j]){
i++;
j++;
}
else{
j++;
}
}
if(i!=lens&&j==lent) return false;
return true;
}
};