https://leetcode.com/problems/is-subsequence/description/
解题思路：
class Solution {
public boolean isSubsequence(String s, String t) {
int sLen = s.length(), tLen = t.length(), sIndex = 0;
for(int i = 0; i < tLen && sIndex < sLen; i++){
if(t.charAt(i) == s.charAt(sIndex)){
sIndex++;
}
}
return sIndex == sLen;
}
}
392. Is Subsequence Medium Given a string s and a string ...
https://leetcode.com/problems/is-subsequence/description/...
题目要求： Given a string s and a string t, check if s is subs...
题目 Given a string s and a string t, check if s is subsequ...
Given a string s and a string t, check if s is subsequenc...
My Submissions Total Accepted: 9572Total Submissions: 217...
原题 判断子序列
原题地址 https://leetcode.com/problems/is-subsequence/descrip...
例子： Example 1: s="abc",t="ahbgdc" Return true. Example 2:...
问题描述：【Greedy】392. Is Subsequence 解题思路： 这道题是给两个字符串 s 和 t，判...
本文标题：392. Is Subsequence
本文链接：https://www.haomeiwen.com/subject/szgcmftx.html
网友评论