392. Is Subsequence

原创于 2017-04-29 15:02:42 发布 · 529 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个算法问题：如何判断一个字符串是否为另一个字符串的子序列。通过实例演示了当两个字符串分别为abc和ahbgdc时返回真，而当字符串为axc和ahbgdc时返回假的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int size1 = s. length();
        int size2 = t.length();
        if(size1 == 0) return true;
        int cnt = 0;
        for(int i = 0; i <= size2; i ++)
        {
        	if(i == size2)
        	return false;
        	if(s[cnt] == t[i])
        	{
        		cnt ++;
        	}
        	if(cnt == size1)
        	{
        		return true;
        	}
        }
    }
};