LeetCode 392 is subsequence

脑子秀逗了，看过的题目做的时候还是会忘记。晚上笔试的时候遇到判断是否为字符子串的问题。其实自己之前就在LeetCode上做过，但是！！！丝毫！！没有印象！！！而且！！！这道题很简单的啊！小拳拳锤我胸口！

下面进入正题：

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.

Follow up: If there are lots of incoming S, say S1, S2, … , Sk where
k >= 1B, and you want to check one by one to see if T has its
subsequence. In this scenario, how would you change your code?

Credits: Special thanks to @pbrother for adding this problem and
creating all test cases.

我做的时候就是暴力解（别问我为什么····），并且忽略了一个重要的问题，就是子串的顺序应该是一致。
比如这种情况：s1=kdfck, s2 = kkc，s2的字符，s1都有，但是顺序是不一样的。我之前的暴力解就忽略了这个问题。

下面上新的解：

public class Main{
    public static boolean isSubsequence(String s1, String s2){
        int i = 0, j = 0;
        while(i < s1.length() && j < s2.length()){
            if(s1.charAt(i) == s2.charAt(j)){
                j++;
            }
            i++;
        }
        return j==s2.length();
    }
}

思路简单，有效，这次记住了吗！！！