leetcode392: 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.

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?

注意：使用两个指针就可以了。每次循环要判断s指针是否指向末端，否则会越界。如果s指针先到达尾部，直接返回true。如果t指针到达了尾部，s的指针还没到尾部，返回false。

问题：越界：s="abc"   t="a"如果s的指针指向"c"，判断成功后，s的指针加一，那么现在s的指针指向什么？

	public boolean isSubsequence(String s, String t) {
		if (s.length() == 0)
			return true;
		int i = 0, j = 0;
		for (; i < t.length(); i++) {
			if (s.charAt(j) == t.charAt(i))
				j++;
			if (j == s.length())
				return true;
		}
		return false;
	}