-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIsSebsequence.cpp
More file actions
45 lines (41 loc) · 1.02 KB
/
Copy pathIsSebsequence.cpp
File metadata and controls
45 lines (41 loc) · 1.02 KB
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
39
40
41
42
43
44
45
/*
Description:
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).
=====
Constraints:
(1) 0 <= s.length <= 100
(2) 0 <= t.length <= 10^4
(3) s and t consist only of lowercase English letters.
=====
Example 1:
Input: s = "abc", t = "ahbgdc"
Output: true
Example 2:
Input: s = "axc", t = "ahbgdc"
Output: false
*/
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
class Solution {
public:
bool isSubsequence(string s, string t) {
int index = 0;
for(char tc : t){
if(s[index] == tc){
index++;
}
}
return index==s.size();
}
};
int main() {
Solution solution;
std::cout << solution.isSubsequence("abc", "ahbgdc");
return 0;
}