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
.
Follow up:
If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?
Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.
题目要求:查询字符串s是否是字符串t的子串(s中的每个字符都能在t中找到,且前后顺序也一样,可以不连续)
思路:遍历s中的每一个字符c,将每个字符c在t中查找,找到第一个包含c的位置index,然后删除t[index]之前的字符串,如果s中的每个字符都能在t中找到,则表示s是t的子字符串。
代码:java
class Solution {
public boolean isSubsequence(String s, String t) {
if( 0 == s.length()) return true;
int lastIndex = 0 ;
for(char c : s.toCharArray()){
int newIndex = t.substring(lastIndex).indexOf(c); //substring(i): 返回i以后的子字符串
if( -1 == newIndex){
return false;
}
lastIndex += newIndex + 1;
}
return true;
}
}