-
Notifications
You must be signed in to change notification settings - Fork 0
/
is_subsequence.cpp
38 lines (29 loc) · 988 Bytes
/
is_subsequence.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
Is Subsequence
Given a string s and a string t, check if s is subsequence of t.
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).
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?
Example 1:
Input: s = "abc", t = "ahbgdc"
Output: true
Example 2:
Input: s = "axc", t = "ahbgdc"
Output: false
*/
class Solution {
public:
bool isSubsequence(string s, string t) {
int c=0,ind=0;
for(int i=0;i<t.length();i++)
{
if(s[ind]==t[i])
{
ind++;
}
}
if(ind==s.length())
return true;
return false;
}
};