392. Is Subsequence
来源:互联网 发布:windows 10 蓝牙 丢失 编辑:程序博客网 时间:2024/05/29 04:48
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.
public class Solution { public boolean isSubsequence(String s, String t) { if (s.length() == 0) { return true; } int indexS = 0, indexT = 0; for (char ch: t.toCharArray()) { if (ch == s.charAt(indexS)) { indexS ++; } if (indexS == s.length()) { return true; } } return false; }}第二种方法,利用的是string的indexOf函数。遍历的是较短的s,根据s的各个字符串去t里面找,如果找不到当前的字符,立马返回false,如果可以顺利遍历完s,返回true。代码如下:
public class Solution { public boolean isSubsequence(String s, String t) { if (t.length() < s.length()) { return false; } int prev = 0; for (char ch: s.toCharArray()) { prev = t.indexOf(ch, prev); if (prev == -1) { return false; } prev ++; } return true; }}
- 392. Is Subsequence
- 392.[LeetCode] Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- LeetCode 392. Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- [LeetCode] 392. Is Subsequence
- 【leetcode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- Leetcode 392. Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- leetcode 392. Is Subsequence
- 392. Is Subsequence**
- JavaScript数据类型和转换
- Vim中复制粘贴缩进错乱问题的解决方案
- Block的内存管理以及变量Capture
- Android加载大图片APP
- 泛化、聚合、关联关系以及场景图用例图
- 392. Is Subsequence
- 【BZOJ4813】 [Cqoi2017]小Q的棋盘
- poj 1958 4汉诺塔问题
- 指针的大小到底是由谁决定?是多少?
- 高度塌陷
- PAT 1003 Emergency(单源最短路径+Dijkstra)
- Longest Common Prefix
- Android开发环境搭建
- 不要62(数位dp)