Is Subsequence

Given a string s and a string t, check if s is subsequence of t.

You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100).

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

Example 1:
s = "abc", t = "ahbgdc"

Return true.

Example 2:
s = "axc", t = "ahbgdc"

Return false.

思路：双指针，i, j, 只要j没有找到，j++; 如果走到头了还没找到return false；找到匹配的了，i++, j++,最后i == s.length();

class Solution {
    public boolean isSubsequence(String s, String t) {
        int i = 0;
        int j = 0;
        while(i < s.length()) {
            char sc = s.charAt(i);
            while(j < t.length() && t.charAt(j) != sc) {
                j++;
            }
            if(j == t.length()) {
                return false;
            }
            i++;
            j++;
        }
        return i == s.length();
    }
}