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.
leetcode2016周赛第一题,这次周赛四道题,标注的都是medium难度,不过这个第一题算是最简单的,两个for循环嵌套,线性遍历一遍就可以了,由于leetcode暂时尚未把这题放出作为regular的题目,所以这里先提供初步解法,后续刷题刷到时再更新。
按顺序在t中逐一寻找s的元素即可,如果找不到即报错。
bool isSubsequence(string s, string t) {
int i, j, last = 0;
for (i = 0; i < s.size(); i++) {
for (j = last; j < t.size(); j++) {
if (s[i] == t[j]) {
last = j + 1;
break;
}
}
if (j == t.size()) return false;
}
return true;
}