判断子序列
/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isSubsequence = function(s, t) {
var sl = s.length;
var tl = t.length;
if (sl === 0) {
return true;
}
if (tl < sl) {
return false;
}
var sindex = 0;
for (let i = 0; i < tl; i++) {
if (s[sindex] == t[i]) {
sindex++;
}
if (sindex === sl) {
return true;
}
}
return false;
};
原题 判断子序列
原题地址 https://leetcode.com/problems/is-subsequence/descrip...
例子： Example 1: s="abc",t="ahbgdc" Return true. Example 2:...
392. Is Subsequence Medium Given a string s and a string ...
问题： Given a string s and a string t, check if s is subseq...
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...
本文标题：[LeetCode] 392. Is Subsequence (
本文链接：https://www.haomeiwen.com/subject/bjiqxqtx.html
网友评论