Leetcode 392) Is Subsequence
in Algorithms
class Solution {
public boolean isSubsequence(String s, String t) {
char[] t_ary = t.toCharArray();
int ptr=0;
for(char i : t_ary){
if(ptr==s.length()){
break;
}
if(i==s.charAt(ptr)){
ptr++;
}
}
if(ptr==s.length()){
return true;
}
return false;
}
}
다른 답안
class Solution {
public boolean isSubsequence(String s, String t) {
int ls = s.length(), lt = t.length();
if (ls == 0) return true;
int indexs = 0, indext = 0;
while (indext < lt) {
if (s.charAt(indexs) == t.charAt(indext)) {
indexs++;
if (indexs == ls) return true;
}
indext++;
}
return false;
}
}