[leetcode 392. Is Subsequence]medium|week 9

一、题目

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,t的下标index1,index2。从0开始往下检索，只要遇到s[index1]=t[index2]，就使他们加1。若检索到t的尾部 index1还没达到最大值则返回false,否则返回true

三、代码

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int size1=s.size();
        int size2=t.size();
        int i=0;
        int j=0;
        int cur=0;
        for(i=0;i<size1;++i){
            for(j=cur;j<size2;++j){
                if(s[i]==t[j]){
                cur=j+1;
                 break;
                 }

            }
            if(j==size2)return false;
        }
        return true;
    }
};