class Solution {
public:
bool isSubsequence(string s, string t) {
int i = 0, j = 0;
int m = s.size(), n = t.size();
while(i < m && j < n){
if(s[i] == t[j]){
i++;
j++;
}
else j++;
}
return i == m;
}
};
判断子序列
最新推荐文章于 2022-06-15 08:35:49 发布