392. Is Subsequence
2017-12-03 18:47
190 查看
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?
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?
class Solution { public boolean isSubsequence(String s, String t) { if(s==null||s.length()==0) return true; int index=0; char ch; for(int i=0;i<s.length();i++){ ch=s.charAt(i); while(index<t.length()&&t.charAt(index)!=ch){ index++; } if(index>=t.length()){ return false; } index++; } return true; } }
相关文章推荐
- [LeetCode] 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
- 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
- 【leetcode】392. Is Subsequence
- Leetcode 392. Is Subsequence
- Leetcode 392. Is Subsequence
- leetcode解题报告:392. Is Subsequence
- leetcode 392. Is Subsequence
- 392. Is Subsequence