判断s是否为t的子序列 Is Subsequence

为什么80%的码农都做不了架构师？>>>   

问题：

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?

解决：

① hash table保存t中字符出现的次数，之后遍历s查找。。。理解错误，子序列虽然可以不连续但是需要保持顺序。

② 双指针遍历。我们可以用两个指针分别指向字符串s和t，然后如果字符相等，则p1和p2自增1，反之只有p2自增1，最后看p1是否等于s的长度，等于说明s已经遍历完了，而且字符都有在t中出现过。

class Solution { //43ms
    public boolean isSubsequence(String s, String t) {
        int p1 = 0;
        int p2 = 0;
        int len1 = s.length();
        int len2 = t.length();
        while(p1 < len1 && p2 < len2){
            if (s.charAt(p1) == t.charAt(p2)){
                p1 ++;
                p2 ++;
            }else{
                p2 ++;
            }
        }
        return p1 == len1;
    }
}

③ 使用String类自带的方法。

class Solution { //3ms
    public boolean isSubsequence(String s, String t) {
        if (s == null && t == null) return true;
        if (s == null || s == null || s.length() > t.length()) return false;
        int start = 0;
        for (int i = 0; i < s.length();i ++){
            start = t.indexOf(s.charAt(i),start) + 1;
            if (start == 0) return false;
        }
        return true;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1600846