Is Subsequence思路:贪心算法,直接两个index去逐个比较s和t即可。
GitHub地址:https://github.com/corpsepiges/leetcode
public class Solution {
public boolean isSubsequence(String s, String t) {
if (s.length()==0) {
return true;
}
int is = 0,it = 0;
while(it<t.length()){
if (s.charAt(is)==t.charAt(it)) {
is++;
if (is==s.length()) {
return true;
}
}
it++;
}
return false;
}
}