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 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?

我的想法

class Solution {
    public boolean isSubsequence(String s, String t) {
        for(int i = 0; i < s.length(); i++){
            String ss = Character.toString(s.charAt(i));
            int index = t.indexOf(ss);
            if(index == -1) return false;
            t = t.substring(index+1);
        }
        return true;
    }
}

解答

basic:
性能比较差

    public boolean isSubsequence_basic(String s, String t) {
        if(s==null) return false;
        if(s.length()==0) return true;
        int i=0, j=0;
        while(i<s.length() && j<t.length()){
            char cs = s.charAt(i);
            char ct = t.charAt(j);
            if(cs==ct){
                i++;
            }
            j++;
        }
        return i==s.length();
    }

Follow up:
binarySearch()的返回值：如果找到直接返回index，找不到返回-(insertion point) - 1。insertion point为第一个大于查找值的数的index，如果查找值大于所有数的话，insertion point为数组的大小

//So the total runtime is O(N + TMlogM), where T is the number of short strings.
    public boolean isSubsequence_followup(String s, String t) {
        List<Integer>[] map = new List[26];
        for(int i=0; i<t.length(); i++){
            int ch = t.charAt(i)-'a';
            if(map[ch]==null){
                map[ch] = new ArrayList<Integer>();
            }
            map[ch].add(i);
        }
        
        //check string s
        int prevIdx = 0;
        for(int i=0; i<s.length(); i++){
            int ch = s.charAt(i)-'a';
            if(map[ch]==null) return false;
            int j = Collections.binarySearch(map[ch], prevIdx);
            if(j<0) j = -j - 1; // binarySearch return  (-(insertion point) - 1) if not found
            if(j==map[ch].size()) return false;//如果大于s[i-1]的index则返回
            prevIdx = map[ch].get(j) + 1;
        }
        return true;
    }
}