LeetCode日记 392.判断子序列

class Solution {
    public boolean isSubsequence(String s, String t) {
          int len1 = s.length();
          int len2 = t.length();
          int i = 0,j = 0;
           while(i<len1&&j<len2){
           //如果子串的当前字符和目标字符串的当前字符匹配，两个指针都后移，
            if(s.charAt(i)==t.charAt(j)){
                i++;
            }
            //不匹配就j后移
            j++;
           }
            return i==len1?true:false;
    }
}