The Subsequence Algorithm for Two Strings – How to Check i
- 时间:2020-09-21 09:15:21
- 分类:网络文摘
- 阅读:72 次
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.
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?
The Two Pointer String Subsequence Algorithm
If source string s is larger than source string t, s must not be a subsequence of t. Otherwise, we can have two pointers i and j, pointing initialially to the begining of the two strings s and t respectively. If at any time, s[i] == t[j], we move both pointers to next position, otherwise, we need to increment j, until either of the pointer is beyond the end of the source string.
If ever i reaches the end, it indicates that source string s is a subsequence of string b. The time complexity of the two pointer algorithm regarding this problem is O(Max(N, M)) where N and M are the sizes of the string s and t respectively.
The algorithm uses a constant O(1) space.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | class Solution { public: bool isSubsequence(string s, string t) { if (s.size() > t.size()) return false; int i = 0, j = 0; int n1 = s.size(), n2 = t.size(); while ((i < n1) && (j < n2)) { if (s[i] == t[j]) { i ++; j ++; } else { j ++; } } return i == n1; } }; |
class Solution { public: bool isSubsequence(string s, string t) { if (s.size() > t.size()) return false; int i = 0, j = 0; int n1 = s.size(), n2 = t.size(); while ((i < n1) && (j < n2)) { if (s[i] == t[j]) { i ++; j ++; } else { j ++; } } return i == n1; } };
–EOF (The Ultimate Computing & Technology Blog) —
推荐阅读:难忘的一节课|小学作文 我们班的“接话王”|小学作文 好习惯从小做起|小学作文 樱花|小学作文 猜谜语 胡耀宇|小学作文 小心老师性侵犯|小学作文 描写圣诞节的小学生作文_圣诞节 关于元宵节的小学生作文300字_在元宵节的夜晚 清明节_关于清明节的小学生记事作文650字 关于春节的小学生作文_我们中国的传统节日——春节
- 评论列表
-
- 添加评论