例子：
Example 1:
s="abc",t="ahbgdc"
Return true.
Example 2:
s="axc",t="ahbgdc"
Return false.
解法：two pointer
base:
如果w1 的pointer等于length of w1, return true
如果w2 的pointer等于length of w2,return false
------
step
对比字母，如果两个单词 w1[0] == w2[0],两个单词同时推进一个
如果两个cha不相等 ，那么就只推进w2的pointer add1,
代码
原题 判断子序列
原题地址 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/sghdnttx.html
网友评论