【Leetcode】Is Subsequence

题目链接：https://leetcode.com/contest/3/problems/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.

思路：

easy，这题应该是今天contest最简单的一道了。伤心。。今天只ac了两道。。卡在Longest Substring with At Least K Repeating Characters这道题了。。

算法：

	public boolean isSubsequence(String s, String t) {

		if (s.length() == 0)
			return true;
		if (t.length() == 0 && t.length() > s.length())
			return false;

		int i = 0, j = 0;

		// char tc = t.charAt(i);
		while (i < s.length() && j < t.length()) {
			if (i >= s.length())
				return true;
			if (s.charAt(i) == t.charAt(j)) {
				i++;
			}
			j++;
		}

		if (i == s.length())
			return true;
		else
			return false;

	}