class Solution {
public:
bool dfs(string& s,string& t,int L,int R){
if(L == s.length()) return true;
if(R == t.length()) return false;
if(s[L] == t[R]) return dfs(s,t,L+1,R+1);
return dfs(s,t,L,R+1);
}
bool isSubsequence(string s, string t) {
return dfs(s,t,0,0);
}
};
No.47 - LeetCode392
最新推荐文章于 2022-08-09 21:05:54 发布