题目:
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
.
思路:这个题目是看在在字符串t中能不能按顺序找到s中的字符,能找到则返回正确,不能找到则返回错误。因为s中一个字符在t中只能出现在s上一个字符在t中出现的位置后面。所以只需便利一遍t,用i记录一共找到了s中的多少个字符。找s中第一个字符时,记录这个字符在t中第一次出现的位置,然后从这个位置开始找s中的下一个字符,就这样依次做先去,当遍历完t后,若i等于s的长度,则返回正确,不等于,则返回错误。
代码:
class Solution {
public:
bool isSubsequence(string s, string t) {
int size1 = s.length();
int size2 = t.length();
int i = 0;
for(int j = 0;j<size2;j++)
{
if(i == size1) break;
else if (t[j]==s[i]) i++;
}
return i == size1;
}
};