[leetcode]392.Is Subsequence|BruteForce|想到别的方法会继续更新

题目

题目分析：
求subsequence的问题，应该用动态规划吧，但是还没有想到合适的转移方程，所以用brute force方法先写了… 想到dp会更新

代码

```java
class Solution {
    public boolean isSubsequence(String s, String t) {
        int sp = 0;
        int i = 0, j = 0;
        while (i < s.length() && j < t.length()) {
            if (s.charAt(i) == t.charAt(j)) {
                i++;
                j++;
                sp++;
            } else {
                j++;
            }
        }
        return sp == s.length();
    }
}

**Runtime:** 14 ms, faster than 63.93% of Java online submissions for Is Subsequence.
**Memory Usage:** 48.3 MB, less than 100.00% of Java online submissions for Is Subsequence.