392.Is Subsequence：修订历史

差异选择：选中要对比的版本的单选按钮，按Enter键或下方的按钮。
说明：（当前）=与最后版本之间的差异，（之前）=与上一版本之间的差异，小=小编辑。

2024年2月19日 (星期一)

  • 当前之前 15:562024年2月19日 (一) 15:56‎ Riguz 讨论 贡献‎ 1,292字节 +1,292‎ 创建页面，内容为“=Description= {{LeetCode |id=is-subsequence |no=392 |difficulty=Easy |category=String |collection=Top 150 |title=Is Subsequence |summary=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 "ab…”
取自“https://riguz.com/392.Is_Subsequence”