forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIsSubsequence.cpp
More file actions
50 lines (46 loc) · 1.51 KB
/
IsSubsequence.cpp
File metadata and controls
50 lines (46 loc) · 1.51 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
46
47
48
49
50
// Source : https://leetcode.com/problems/is-subsequence/
// Author : Hao Chen
// Date : 2016-09-08
/***************************************************************************************
*
* 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 (
*
* 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.
*
* 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?
***************************************************************************************/
class Solution {
public:
bool isSubsequence(string s, string t) {
if (s.size() <= 0) return true;
int ps=0, pt=0;
while (pt < t.size()) {
if (s[ps] == t[pt]) {
ps++; pt++;
if (ps >= s.size()) return true;
}else {
pt++;
}
}
return false;
}
};