Leecode-------2021.04.18

双指针

392. 判断子序列

class Solution {
    public boolean isSubsequence(String s, String t) {
        int i = 0;
        int j = 0;
        int n = s.length();
        int m = t.length();
        while(i < n && j < m){
            if(s.charAt(i) == t.charAt(j)){
                i++;// 匹配上的话i就右移
            }
            j++;
        }
        return i == n;
        
    }
}