【leetcode】392. Is Subsequence

最新推荐文章于 2024-09-23 11:27:55 发布

小拳头

最新推荐文章于 2024-09-23 11:27:55 发布

阅读量351

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/xiaoquantouer/article/details/52912206

版权

leetcode 专栏收录该内容

119 篇文章 3 订阅

订阅专栏

一、题目描述

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 的子串，所以对于s，顺序遍历每个字符，对于每个字符到t 中去匹配，用i, j 分别表示 s 和 t 的下标，当没有匹配上，j++，如果匹配上了，就i++,j++。最后退出循环的条件是s 或者 t 的字符遍历完了。最后判断i 和j 的值即可。只有当i == s.length() 并且 j<=t.length() 时才说明s 是t 的子串，其他都不是。

c++代码（89ms，34.22%）

class Solution {
public:
    bool isSubsequence(string s, string t) {
        //s是t的子串 
    	int len1,len2;
    	len1 = s.length();
    	len2 = t.length();
    	if(len1==0){
    		return true;
    	}
    	if(len1>len2){
    		return false;
    	}
    	if(s == t){
    		return true;
    	}
    	int i=0,j=0;  //i表示s的下标，j表示t的下标
    	while(i<len1 && j<len2){
    		while(s[i]!=t[j] && j<len2){
    			j++;
    		}//while
    		i++;
    		j++;
    	}
    	if(i==len1 && j<=len2){
    		return true;
    	}else{
    		return false;
    	}
    }
};

讨论区大神的代码：

class Solution {
public:
    bool isSubsequence(string s, string t) {
    	auto i = s.begin();
        for(char c : t) i += (*i == c);
        return i == s.end();
    }
};