1. 题目
https://leetcode.cn/problems/is-subsequence/
2. 我的解法
双指针
class Solution {
public boolean isSubsequence(String s, String t) {
if(s.equals("")){
return true;
}
if(s.length()>t.length()){
return false;
}
String []s1=s.split("");
String []t1=t.split("");
int scount=0,tcount=0;
while (true){
if(s1[scount].equals(t1[tcount])){
scount++;
tcount++;
}else{
tcount++;
}
if(scount==s.length()||tcount==t.length()){
break;
}
}
if(scount==s.length()){
return true;
}else{
return false;
}
}
}
3. 更佳解法
https://leetcode.cn/problems/is-subsequence/solution/pan-duan-zi-xu-lie-by-leetcode-solution/
学习一下,方法二:动态规划