[LeetCode] Is Subsequence

392. Is Subsequence

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., “ace” is a subsequence of “abcde” while “aec” is not).

1
2
3
4
5
6
7
8
9
10
class Solution {
public:
bool isSubsequence(string s, string t) {
int i = 0;
for(int j = 0; j < t.length() and i < s.length(); j++) {
if(s[i] == t[j]) i++;
}
return i == s.length();
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/02/19/PS/LeetCode/is-subsequence/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.