leetcode刷题系列:392. Is Subsequence
来源:互联网 发布:nginx 打印php错误 编辑:程序博客网 时间:2024/06/12 01:01
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?
Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
class Solution {public: bool isSubsequence(string s, string t) { int lens = s.size(); int lent = t.size(); if(lens > lent) return false; int start = 0; int j = 0; for(int i = 0; i < lens; ++i) { for(; j < lent;j++) { if(s[i] == t[j]) { if(j == lent - 1 && i != lens - 1) return false; j++; break; } else { if( j == lent - 1 ) return false; continue; } } } return true; }};
- leetcode刷题系列:392. Is Subsequence
- 392.[LeetCode] Is Subsequence
- LeetCode 392. Is Subsequence
- [LeetCode] 392. Is Subsequence
- 【leetcode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- Leetcode 392. Is Subsequence
- leetcode 392. Is Subsequence
- LeetCode 392. Is Subsequence
- 【LeetCode】 392. Is Subsequence
- LeetCode 392. Is Subsequence
- LeetCode 392. Is Subsequence
- Leetcode-392. Is Subsequence
- Leetcode-392. Is Subsequence
- Leetcode 392. Is Subsequence
- leetcode 392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- Vitamio 自定义视频缓存路径
- System.Data.SqlClient.SqlException: 用户 'sa' 登录失败。
- 测试1031
- 贪心法--最小生成树的Prim算法和Kruskal算法
- CentOS 7.x 下配置iSCSI网络存储
- leetcode刷题系列:392. Is Subsequence
- 测试1031
- Log Aggregator 비교 - Scribe, Flume, Fluentd, logstash
- Django下测试与调试REST API的方法
- python核心编程-第12章课后练习答案
- Ubuntu 16.04与Windows 10优缺点对比,个人理解
- 关于金融类数据运算的技术总结
- cpp的函数对象和谓词
- 高斯函数