[Leetcode] 392. 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 sis 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?

思路：

这道题目我一眼看去觉得就是一道动态规划，因为状态转移方程很明显。然而动态规划却不是本题目的最优解。。。看来刷题刷多了就会陷入思维定势，可怕。

其实最简单的方法是贪心，只要用两个指针来判断当前两个字符串中的字符是否相等就可以了。

代码：

class Solution {
public:
    bool isSubsequence(string s, string t) {
        if (s.length() > t.length()) {
            return false;
        }
        int length_s = s.length(), length_t = t.length();
        int k_s = 0, k_t = 0;
        while (k_s < length_s && k_t < length_t) {
            if (s[k_s] == t[k_t]) {     // matched
                ++k_s;
            }
            ++k_t;
        }
        return k_s == length_s;
    }
};