leetcode 392. 判断子序列
思路
- t中出现s中的字母，则index++
- 最终判断index是否到s的末尾
class Solution {
public:bool isSubsequence(string s, string t) {int index = 0;for (int i=0; i<t.size(); ++i) {if (index<s.size() && s[index] == t[i]) index++;}return index == s.size();}
};
思路
class Solution {
public:bool isSubsequence(string s, string t) {int index = 0;for (int i=0; i<t.size(); ++i) {if (index<s.size() && s[index] == t[i]) index++;}return index == s.size();}
};