LeetCode --- 392. Is Subsequence 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 392. Is Subsequence 解题报告相关的知识,希望对你有一定的参考价值。
Given two strings s
and t
, return true
if s
is a subsequence of t
, or false
otherwise.
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace"
is a subsequence of "abcde"
while "aec"
is not).
Example 1:
Input: s = "abc", t = "ahbgdc" Output: true
Example 2:
Input: s = "axc", t = "ahbgdc" Output: false
Constraints:
0 <= s.length <
以上是关于LeetCode --- 392. Is Subsequence 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode] 392. Is Subsequence Java
LeetCode --- 392. Is Subsequence 解题报告