392.判断子序列
题解:
双指针遍历
class Solution {
public boolean isSubsequence(String s, String t) {
int n = s.length(), m = t.length();
int i = 0, j = 0;
while(n > i && m > j){
if(s.charAt(i) == t.charAt(j)){
i++;
}
j++;
}
return i == n;
}
}
微信扫一扫
双指针遍历
class Solution {
public boolean isSubsequence(String s, String t) {
int n = s.length(), m = t.length();
int i = 0, j = 0;
while(n > i && m > j){
if(s.charAt(i) == t.charAt(j)){
i++;
}
j++;
}
return i == n;
}
}
相关推荐