# [LeetCode] 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.

class Solution {
public:
bool isSubsequence(string s, string t) {
if (s.empty()) return true;
int i = 0, j = 0;
while (i < s.size() && j < t.size()) {
if (s[i] == t[j]) {
++i; ++j;
} else {
++j;
}
}
return i == s.size();
}
};

class Solution {
public:
bool isSubsequence(string s, string t) {
if (s.empty()) return true;
int i = 0, j = 0;
while (i < s.size() && j < t.size()) {
if (s[i] == t[j]) ++i;
++j;
}
return i == s.size();
}
};

|
2月前

47 0
|
2月前
|

[Java·算法·简单] LeetCode 392. 判断子序列 详细解读
[Java·算法·简单] LeetCode 392. 判断子序列 详细解读
53 0
|
1月前
|

16 1
|
1月前
|

LeetCode题目115:不同子序列
LeetCode题目115:不同子序列
13 1
|
25天前
|

9 0
|
1月前
|

【经典算法】LeetCode 392 判断子序列(Java/C/Python3/Go实现含注释说明,Easy)
【经典算法】LeetCode 392 判断子序列(Java/C/Python3/Go实现含注释说明,Easy)
29 0
|
2月前
|

42 1
|
2月前
|

【力扣】392.判断子序列
【力扣】392.判断子序列
19 1
|
2月前
|

【单调队列】LeetCode1425:带限制的子序列和
【单调队列】LeetCode1425:带限制的子序列和
32 0
|
2月前
|
Java
leetcode 516. 最长回文子序列(JAVA)题解
leetcode 516. 最长回文子序列(JAVA)题解
33 0